9,034,312

2³ × 7 × 29 × 5563

9,034,312 factors as 2^3 × 7 × 29 × 5563. Its 32 positive divisors give a proper-divisor sum of 10,996,088, so this integer is abundant. The Collatz stopping time is 150 steps.

Prime Factor Structure

Factorization String 2^3 × 7 × 29 × 5563

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 20,030,400

Proper Divisor Sum 10,996,088

Digit Sum / Digital Root 22 (Root: 4)

Adjacent Primes #9034307 ← → #9034351

Radix Representation

Decimal	9034312
Binary	100010011101101001001000 (24 bits)
Octal	0o42355110
Hexadecimal	0x89DA48

Divisor Catalog (32)

Collatz Trajectory (150 steps to reach 1)

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

9,034,312 4,517,156 2,258,578 1,129,289 3,387,868 1,693,934 846,967 2,540,902 1,270,451 3,811,354 1,905,677 5,717,032 2,858,516 1,429,258 714,629 2,143,888 1,071,944 535,972 267,986 133,993 401,980 200,990 100,495 301,486 150,743 452,230 226,115 678,346 339,173 1,017,520 508,760 254,380 127,190 63,595 190,786 95,393 286,180 143,090 71,545 214,636 107,318 53,659 160,978 80,489 241,468 120,734 60,367 181,102 90,551 271,654 135,827 407,482 203,741 611,224 305,612 152,806 76,403 229,210 114,605 343,816

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

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