30,293,232

2⁴ × 3 × 37² × 461

30,293,232 factors as 2^4 × 3 × 37^2 × 461. Its 60 positive divisors give a proper-divisor sum of 50,310,984, so this integer is abundant. The Collatz stopping time is 131 steps.

Prime Factor Structure

Factorization String 2^4 × 3 × 37^2 × 461

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 60

Divisor Sum (σ) 80,604,216

Proper Divisor Sum 50,310,984

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #30293213 ← → #30293251

Radix Representation

Decimal	30293232
Binary	1110011100011110011110000 (25 bits)
Octal	0o163436360
Hexadecimal	0x1CE3CF0

Divisor Catalog (60)

1 2 3 4 6 8 12 16 24 37 48 74 111 148 222 296 444 461 592 888 922 1,369 1,383 1,776 1,844 2,738 2,766 3,688 4,107 5,476 5,532 7,376 8,214 10,952 11,064 16,428 17,057 21,904 22,128 32,856 34,114 51,171 65,712 68,228 102,342 136,456 204,684 272,912 409,368 631,109 818,736 1,262,218 1,893,327 2,524,436 3,786,654 5,048,872 7,573,308 10,097,744 15,146,616 30,293,232

Collatz Trajectory (131 steps to reach 1)

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

30,293,232 15,146,616 7,573,308 3,786,654 1,893,327 5,679,982 2,839,991 8,519,974 4,259,987 12,779,962 6,389,981 19,169,944 9,584,972 4,792,486 2,396,243 7,188,730 3,594,365 10,783,096 5,391,548 2,695,774 1,347,887 4,043,662 2,021,831 6,065,494 3,032,747 9,098,242 4,549,121 13,647,364 6,823,682 3,411,841 10,235,524 5,117,762 2,558,881 7,676,644 3,838,322 1,919,161 5,757,484 2,878,742 1,439,371 4,318,114 2,159,057 6,477,172 3,238,586 1,619,293 4,857,880 2,428,940 1,214,470 607,235 1,821,706 910,853 2,732,560 1,366,280 683,140 341,570 170,785 512,356 256,178 128,089 384,268 192,134

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #30,293,231 Browse Full Index Next Integer #30,293,233 →