9,440,862

2 × 3 × 1573477

9,440,862 factors as 2 × 3 × 1573477. Its 8 positive divisors give a proper-divisor sum of 9,440,874, so this integer is abundant. The Collatz stopping time is 300 steps.

Prime Factor Structure

Factorization String 2 × 3 × 1573477

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 18,881,736

Proper Divisor Sum 9,440,874

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #9440857 ← → #9440869

Radix Representation

Decimal	9440862
Binary	100100000000111001011110 (24 bits)
Octal	0o44007136
Hexadecimal	0x900E5E

Divisor Catalog (8)

1 2 3 6 1,573,477 3,146,954 4,720,431 9,440,862

Collatz Trajectory (300 steps to reach 1)

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

9,440,862 4,720,431 14,161,294 7,080,647 21,241,942 10,620,971 31,862,914 15,931,457 47,794,372 23,897,186 11,948,593 35,845,780 17,922,890 8,961,445 26,884,336 13,442,168 6,721,084 3,360,542 1,680,271 5,040,814 2,520,407 7,561,222 3,780,611 11,341,834 5,670,917 17,012,752 8,506,376 4,253,188 2,126,594 1,063,297 3,189,892 1,594,946 797,473 2,392,420 1,196,210 598,105 1,794,316 897,158 448,579 1,345,738 672,869 2,018,608 1,009,304 504,652 252,326 126,163 378,490 189,245 567,736 283,868 141,934 70,967 212,902 106,451 319,354 159,677 479,032 239,516 119,758 59,879

← Previous Integer #9,440,861 Browse Full Index Next Integer #9,440,863 →