9,740,642

2 × 101 × 48221

9,740,642 factors as 2 × 101 × 48221. Its 8 positive divisors give a proper-divisor sum of 5,015,290, so this integer is deficient. The Collatz stopping time is 62 steps.

Prime Factor Structure

Factorization String 2 × 101 × 48221

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 14,755,932

Proper Divisor Sum 5,015,290

Digit Sum / Digital Root 32 (Root: 5)

Adjacent Primes #9740639 ← → #9740651

Radix Representation

Decimal	9740642
Binary	100101001010000101100010 (24 bits)
Octal	0o45120542
Hexadecimal	0x94A162

Divisor Catalog (8)

1 2 101 202 48,221 96,442 4,870,321 9,740,642

Collatz Trajectory (62 steps to reach 1)

Iterative sequence n → n/2 (if even) or 3n+1 (if odd):

9,740,642 4,870,321 14,610,964 7,305,482 3,652,741 10,958,224 5,479,112 2,739,556 1,369,778 684,889 2,054,668 1,027,334 513,667 1,541,002 770,501 2,311,504 1,155,752 577,876 288,938 144,469 433,408 216,704 108,352 54,176 27,088 13,544 6,772 3,386 1,693 5,080 2,540 1,270 635 1,906 953 2,860 1,430 715 2,146 1,073 3,220 1,610 805 2,416 1,208 604 302 151 454 227 682 341 1,024 512 256 128 64 32 16 8

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #9,740,641 Browse Full Index Next Integer #9,740,643 →