9,274,900

2² × 5² × 137 × 677

9,274,900 factors as 2^2 × 5^2 × 137 × 677. Its 36 positive divisors give a proper-divisor sum of 11,028,488, so this integer is abundant. The Collatz stopping time is 212 steps.

Prime Factor Structure

Factorization String 2^2 × 5^2 × 137 × 677

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 36

Divisor Sum (σ) 20,303,388

Proper Divisor Sum 11,028,488

Digit Sum / Digital Root 31 (Root: 4)

Adjacent Primes #9274883 ← → #9274939

Radix Representation

Decimal	9274900
Binary	100011011000011000010100 (24 bits)
Octal	0o43303024
Hexadecimal	0x8D8614

Divisor Catalog (36)

1 2 4 5 10 20 25 50 100 137 274 548 677 685 1,354 1,370 2,708 2,740 3,385 3,425 6,770 6,850 13,540 13,700 16,925 33,850 67,700 92,749 185,498 370,996 463,745 927,490 1,854,980 2,318,725 4,637,450 9,274,900

Collatz Trajectory (212 steps to reach 1)

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

9,274,900 4,637,450 2,318,725 6,956,176 3,478,088 1,739,044 869,522 434,761 1,304,284 652,142 326,071 978,214 489,107 1,467,322 733,661 2,200,984 1,100,492 550,246 275,123 825,370 412,685 1,238,056 619,028 309,514 154,757 464,272 232,136 116,068 58,034 29,017 87,052 43,526 21,763 65,290 32,645 97,936 48,968 24,484 12,242 6,121 18,364 9,182 4,591 13,774 6,887 20,662 10,331 30,994 15,497 46,492 23,246 11,623 34,870 17,435 52,306 26,153 78,460 39,230 19,615 58,846

← Previous Integer #9,274,899 Browse Full Index Next Integer #9,274,901 →