9,483,706

2 × 31 × 151 × 1013

9,483,706 factors as 2 × 31 × 151 × 1013. Its 16 positive divisors give a proper-divisor sum of 5,312,582, so this integer is deficient. The Collatz stopping time is 150 steps.

Prime Factor Structure

Factorization String 2 × 31 × 151 × 1013

Distinct Prime Factors 4

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 14,796,288

Proper Divisor Sum 5,312,582

Digit Sum / Digital Root 37 (Root: 1)

Adjacent Primes #9483697 ← → #9483709

Radix Representation

Decimal	9483706
Binary	100100001011010110111010 (24 bits)
Octal	0o44132672
Hexadecimal	0x90B5BA

Divisor Catalog (16)

1 2 31 62 151 302 1,013 2,026 4,681 9,362 31,403 62,806 152,963 305,926 4,741,853 9,483,706

Collatz Trajectory (150 steps to reach 1)

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

9,483,706 4,741,853 14,225,560 7,112,780 3,556,390 1,778,195 5,334,586 2,667,293 8,001,880 4,000,940 2,000,470 1,000,235 3,000,706 1,500,353 4,501,060 2,250,530 1,125,265 3,375,796 1,687,898 843,949 2,531,848 1,265,924 632,962 316,481 949,444 474,722 237,361 712,084 356,042 178,021 534,064 267,032 133,516 66,758 33,379 100,138 50,069 150,208 75,104 37,552 18,776 9,388 4,694 2,347 7,042 3,521 10,564 5,282 2,641 7,924 3,962 1,981 5,944 2,972 1,486 743 2,230 1,115 3,346 1,673

← Previous Integer #9,483,705 Browse Full Index Next Integer #9,483,707 →