9,025,800

2³ × 3 × 5² × 7² × 307

9,025,800 factors as 2^3 × 3 × 5^2 × 7^2 × 307. Its 144 positive divisors give a proper-divisor sum of 23,628,360, so this integer is abundant. The Collatz stopping time is 163 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 5^2 × 7^2 × 307

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 144

Divisor Sum (σ) 32,654,160

Proper Divisor Sum 23,628,360

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #9025789 ← → #9025801

Radix Representation

Decimal	9025800
Binary	100010011011100100001000 (24 bits)
Octal	0o42334410
Hexadecimal	0x89B908

Divisor Catalog (60 of 144)

1 2 3 4 5 6 7 8 10 12 14 15 20 21 24 25 28 30 35 40 42 49 50 56 60 70 75 84 98 100 105 120 140 147 150 168 175 196 200 210 245 280 294 300 307 350 392 420 490 525 588 600 614 700 735 840 921 980 1,050 1,176

Collatz Trajectory (163 steps to reach 1)

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

9,025,800 4,512,900 2,256,450 1,128,225 3,384,676 1,692,338 846,169 2,538,508 1,269,254 634,627 1,903,882 951,941 2,855,824 1,427,912 713,956 356,978 178,489 535,468 267,734 133,867 401,602 200,801 602,404 301,202 150,601 451,804 225,902 112,951 338,854 169,427 508,282 254,141 762,424 381,212 190,606 95,303 285,910 142,955 428,866 214,433 643,300 321,650 160,825 482,476 241,238 120,619 361,858 180,929 542,788 271,394 135,697 407,092 203,546 101,773 305,320 152,660 76,330 38,165 114,496 57,248

← Previous Integer #9,025,799 Browse Full Index Next Integer #9,025,801 →