4,632,072

2³ × 3 × 193003

4,632,072 factors as 2^3 × 3 × 193003. Its 16 positive divisors give a proper-divisor sum of 6,948,168, so this integer is abundant. The Collatz stopping time is 149 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 193003

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 11,580,240

Proper Divisor Sum 6,948,168

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #4632053 ← → #4632073

Radix Representation

Decimal	4632072
Binary	10001101010111000001000 (23 bits)
Octal	0o21527010
Hexadecimal	0x46AE08

Divisor Catalog (16)

1 2 3 4 6 8 12 24 193,003 386,006 579,009 772,012 1,158,018 1,544,024 2,316,036 4,632,072

Collatz Trajectory (149 steps to reach 1)

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

4,632,072 2,316,036 1,158,018 579,009 1,737,028 868,514 434,257 1,302,772 651,386 325,693 977,080 488,540 244,270 122,135 366,406 183,203 549,610 274,805 824,416 412,208 206,104 103,052 51,526 25,763 77,290 38,645 115,936 57,968 28,984 14,492 7,246 3,623 10,870 5,435 16,306 8,153 24,460 12,230 6,115 18,346 9,173 27,520 13,760 6,880 3,440 1,720 860 430 215 646 323 970 485 1,456 728 364 182 91 274 137

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,632,071 Browse Full Index Next Integer #4,632,073 →