9,487,568

2⁴ × 592973

9,487,568 factors as 2^4 × 592973. Its 10 positive divisors give a proper-divisor sum of 8,894,626, so this integer is deficient. The Collatz stopping time is 106 steps.

Prime Factor Structure

Factorization String 2^4 × 592973

Distinct Prime Factors 2

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 10

Divisor Sum (σ) 18,382,194

Proper Divisor Sum 8,894,626

Digit Sum / Digital Root 47 (Root: 2)

Adjacent Primes #9487529 ← → #9487571

Radix Representation

Decimal	9487568
Binary	100100001100010011010000 (24 bits)
Octal	0o44142320
Hexadecimal	0x90C4D0

Divisor Catalog (10)

1 2 4 8 16 592,973 1,185,946 2,371,892 4,743,784 9,487,568

Collatz Trajectory (106 steps to reach 1)

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

9,487,568 4,743,784 2,371,892 1,185,946 592,973 1,778,920 889,460 444,730 222,365 667,096 333,548 166,774 83,387 250,162 125,081 375,244 187,622 93,811 281,434 140,717 422,152 211,076 105,538 52,769 158,308 79,154 39,577 118,732 59,366 29,683 89,050 44,525 133,576 66,788 33,394 16,697 50,092 25,046 12,523 37,570 18,785 56,356 28,178 14,089 42,268 21,134 10,567 31,702 15,851 47,554 23,777 71,332 35,666 17,833 53,500 26,750 13,375 40,126 20,063 60,190

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #9,487,567 Browse Full Index Next Integer #9,487,569 →