9,148,752

2⁴ × 3² × 63533

9,148,752 factors as 2^4 × 3^2 × 63533. Its 30 positive divisors give a proper-divisor sum of 16,455,450, so this integer is abundant. The Collatz stopping time is 132 steps.

Prime Factor Structure

Factorization String 2^4 × 3^2 × 63533

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 30

Divisor Sum (σ) 25,604,202

Proper Divisor Sum 16,455,450

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #9148739 ← → #9148757

Radix Representation

Decimal	9148752
Binary	100010111001100101010000 (24 bits)
Octal	0o42714520
Hexadecimal	0x8B9950

Divisor Catalog (30)

1 2 3 4 6 8 9 12 16 18 24 36 48 72 144 63,533 127,066 190,599 254,132 381,198 508,264 571,797 762,396 1,016,528 1,143,594 1,524,792 2,287,188 3,049,584 4,574,376 9,148,752

Collatz Trajectory (132 steps to reach 1)

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

9,148,752 4,574,376 2,287,188 1,143,594 571,797 1,715,392 857,696 428,848 214,424 107,212 53,606 26,803 80,410 40,205 120,616 60,308 30,154 15,077 45,232 22,616 11,308 5,654 2,827 8,482 4,241 12,724 6,362 3,181 9,544 4,772 2,386 1,193 3,580 1,790 895 2,686 1,343 4,030 2,015 6,046 3,023 9,070 4,535 13,606 6,803 20,410 10,205 30,616 15,308 7,654 3,827 11,482 5,741 17,224 8,612 4,306 2,153 6,460 3,230 1,615

← Previous Integer #9,148,751 Browse Full Index Next Integer #9,148,753 →