9,026,920

2³ × 5 × 7 × 103 × 313

9,026,920 factors as 2^3 × 5 × 7 × 103 × 313. Its 64 positive divisors give a proper-divisor sum of 14,485,400, so this integer is abundant. The Collatz stopping time is 256 steps.

Prime Factor Structure

Factorization String 2^3 × 5 × 7 × 103 × 313

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 64

Divisor Sum (σ) 23,512,320

Proper Divisor Sum 14,485,400

Digit Sum / Digital Root 28 (Root: 1)

Adjacent Primes #9026903 ← → #9026933

Radix Representation

Decimal	9026920
Binary	100010011011110101101000 (24 bits)
Octal	0o42336550
Hexadecimal	0x89BD68

Divisor Catalog (60 of 64)

1 2 4 5 7 8 10 14 20 28 35 40 56 70 103 140 206 280 313 412 515 626 721 824 1,030 1,252 1,442 1,565 2,060 2,191 2,504 2,884 3,130 3,605 4,120 4,382 5,768 6,260 7,210 8,764 10,955 12,520 14,420 17,528 21,910 28,840 32,239 43,820 64,478 87,640 128,956 161,195 225,673 257,912 322,390 451,346 644,780 902,692 1,128,365 1,289,560

Collatz Trajectory (256 steps to reach 1)

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

9,026,920 4,513,460 2,256,730 1,128,365 3,385,096 1,692,548 846,274 423,137 1,269,412 634,706 317,353 952,060 476,030 238,015 714,046 357,023 1,071,070 535,535 1,606,606 803,303 2,409,910 1,204,955 3,614,866 1,807,433 5,422,300 2,711,150 1,355,575 4,066,726 2,033,363 6,100,090 3,050,045 9,150,136 4,575,068 2,287,534 1,143,767 3,431,302 1,715,651 5,146,954 2,573,477 7,720,432 3,860,216 1,930,108 965,054 482,527 1,447,582 723,791 2,171,374 1,085,687 3,257,062 1,628,531 4,885,594 2,442,797 7,328,392 3,664,196 1,832,098 916,049 2,748,148 1,374,074 687,037 2,061,112

← Previous Integer #9,026,919 Browse Full Index Next Integer #9,026,921 →