9,927,474

2 × 3 × 1654579

9,927,474 factors as 2 × 3 × 1654579. Its 8 positive divisors give a proper-divisor sum of 9,927,486, so this integer is abundant. The Collatz stopping time is 163 steps.

Prime Factor Structure

Factorization String 2 × 3 × 1654579

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 19,854,960

Proper Divisor Sum 9,927,486

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #9927397 ← → #9927487

Radix Representation

Decimal	9927474
Binary	100101110111101100110010 (24 bits)
Octal	0o45675462
Hexadecimal	0x977B32

Divisor Catalog (8)

1 2 3 6 1,654,579 3,309,158 4,963,737 9,927,474

Collatz Trajectory (163 steps to reach 1)

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

9,927,474 4,963,737 14,891,212 7,445,606 3,722,803 11,168,410 5,584,205 16,752,616 8,376,308 4,188,154 2,094,077 6,282,232 3,141,116 1,570,558 785,279 2,355,838 1,177,919 3,533,758 1,766,879 5,300,638 2,650,319 7,950,958 3,975,479 11,926,438 5,963,219 17,889,658 8,944,829 26,834,488 13,417,244 6,708,622 3,354,311 10,062,934 5,031,467 15,094,402 7,547,201 22,641,604 11,320,802 5,660,401 16,981,204 8,490,602 4,245,301 12,735,904 6,367,952 3,183,976 1,591,988 795,994 397,997 1,193,992 596,996 298,498 149,249 447,748 223,874 111,937 335,812 167,906 83,953 251,860 125,930 62,965

← Previous Integer #9,927,473 Browse Full Index Next Integer #9,927,475 →