69,737,232

2⁴ × 3 × 1452859

69,737,232 factors as 2^4 × 3 × 1452859. Its 20 positive divisors give a proper-divisor sum of 110,417,408, so this integer is abundant. The Collatz stopping time is 96 steps.

Prime Factor Structure

Factorization String 2^4 × 3 × 1452859

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 20

Divisor Sum (σ) 180,154,640

Proper Divisor Sum 110,417,408

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #69737203 ← → #69737251

Radix Representation

Decimal	69737232
Binary	100001010000001101100010000 (27 bits)
Octal	0o412015420
Hexadecimal	0x4281B10

Divisor Catalog (20)

Collatz Trajectory (96 steps to reach 1)

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

69,737,232 34,868,616 17,434,308 8,717,154 4,358,577 13,075,732 6,537,866 3,268,933 9,806,800 4,903,400 2,451,700 1,225,850 612,925 1,838,776 919,388 459,694 229,847 689,542 344,771 1,034,314 517,157 1,551,472 775,736 387,868 193,934 96,967 290,902 145,451 436,354 218,177 654,532 327,266 163,633 490,900 245,450 122,725 368,176 184,088 92,044 46,022 23,011 69,034 34,517 103,552 51,776 25,888 12,944 6,472 3,236 1,618 809 2,428 1,214 607 1,822 911 2,734 1,367 4,102 2,051

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #69,737,231 Browse Full Index Next Integer #69,737,233 →