9,544,908

2² × 3 × 23 × 34583

9,544,908 factors as 2^2 × 3 × 23 × 34583. Its 24 positive divisors give a proper-divisor sum of 13,695,540, so this integer is abundant. The Collatz stopping time is 101 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 23 × 34583

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 23,240,448

Proper Divisor Sum 13,695,540

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #9544903 ← → #9544919

Radix Representation

Decimal	9544908
Binary	100100011010010011001100 (24 bits)
Octal	0o44322314
Hexadecimal	0x91A4CC

Divisor Catalog (24)

1 2 3 4 6 12 23 46 69 92 138 276 34,583 69,166 103,749 138,332 207,498 414,996 795,409 1,590,818 2,386,227 3,181,636 4,772,454 9,544,908

Collatz Trajectory (101 steps to reach 1)

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

9,544,908 4,772,454 2,386,227 7,158,682 3,579,341 10,738,024 5,369,012 2,684,506 1,342,253 4,026,760 2,013,380 1,006,690 503,345 1,510,036 755,018 377,509 1,132,528 566,264 283,132 141,566 70,783 212,350 106,175 318,526 159,263 477,790 238,895 716,686 358,343 1,075,030 537,515 1,612,546 806,273 2,418,820 1,209,410 604,705 1,814,116 907,058 453,529 1,360,588 680,294 340,147 1,020,442 510,221 1,530,664 765,332 382,666 191,333 574,000 287,000 143,500 71,750 35,875 107,626 53,813 161,440 80,720 40,360 20,180 10,090

← Previous Integer #9,544,907 Browse Full Index Next Integer #9,544,909 →