9,615,312

2⁴ × 3² × 7 × 9539

9,615,312 factors as 2^4 × 3^2 × 7 × 9539. Its 60 positive divisors give a proper-divisor sum of 21,141,648, so this integer is abundant. The Collatz stopping time is 93 steps.

Prime Factor Structure

Factorization String 2^4 × 3^2 × 7 × 9539

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 60

Divisor Sum (σ) 30,756,960

Proper Divisor Sum 21,141,648

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #9615271 ← → #9615323

Radix Representation

Decimal	9615312
Binary	100100101011011111010000 (24 bits)
Octal	0o44533720
Hexadecimal	0x92B7D0

Divisor Catalog (60)

1 2 3 4 6 7 8 9 12 14 16 18 21 24 28 36 42 48 56 63 72 84 112 126 144 168 252 336 504 1,008 9,539 19,078 28,617 38,156 57,234 66,773 76,312 85,851 114,468 133,546 152,624 171,702 200,319 228,936 267,092 343,404 400,638 457,872 534,184 600,957 686,808 801,276 1,068,368 1,201,914 1,373,616 1,602,552 2,403,828 3,205,104 4,807,656 9,615,312

Collatz Trajectory (93 steps to reach 1)

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

9,615,312 4,807,656 2,403,828 1,201,914 600,957 1,802,872 901,436 450,718 225,359 676,078 338,039 1,014,118 507,059 1,521,178 760,589 2,281,768 1,140,884 570,442 285,221 855,664 427,832 213,916 106,958 53,479 160,438 80,219 240,658 120,329 360,988 180,494 90,247 270,742 135,371 406,114 203,057 609,172 304,586 152,293 456,880 228,440 114,220 57,110 28,555 85,666 42,833 128,500 64,250 32,125 96,376 48,188 24,094 12,047 36,142 18,071 54,214 27,107 81,322 40,661 121,984 60,992

← Previous Integer #9,615,311 Browse Full Index Next Integer #9,615,313 →