4,784,112

2⁴ × 3² × 33223

4,784,112 factors as 2^4 × 3^2 × 33223. Its 30 positive divisors give a proper-divisor sum of 8,605,160, so this integer is abundant. The Collatz stopping time is 237 steps.

Prime Factor Structure

Factorization String 2^4 × 3^2 × 33223

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 30

Divisor Sum (σ) 13,389,272

Proper Divisor Sum 8,605,160

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #4784107 ← → #4784141

Radix Representation

Decimal	4784112
Binary	10010001111111111110000 (23 bits)
Octal	0o22177760
Hexadecimal	0x48FFF0

Divisor Catalog (30)

1 2 3 4 6 8 9 12 16 18 24 36 48 72 144 33,223 66,446 99,669 132,892 199,338 265,784 299,007 398,676 531,568 598,014 797,352 1,196,028 1,594,704 2,392,056 4,784,112

Collatz Trajectory (237 steps to reach 1)

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

4,784,112 2,392,056 1,196,028 598,014 299,007 897,022 448,511 1,345,534 672,767 2,018,302 1,009,151 3,027,454 1,513,727 4,541,182 2,270,591 6,811,774 3,405,887 10,217,662 5,108,831 15,326,494 7,663,247 22,989,742 11,494,871 34,484,614 17,242,307 51,726,922 25,863,461 77,590,384 38,795,192 19,397,596 9,698,798 4,849,399 14,548,198 7,274,099 21,822,298 10,911,149 32,733,448 16,366,724 8,183,362 4,091,681 12,275,044 6,137,522 3,068,761 9,206,284 4,603,142 2,301,571 6,904,714 3,452,357 10,357,072 5,178,536 2,589,268 1,294,634 647,317 1,941,952 970,976 485,488 242,744 121,372 60,686 30,343

← Previous Integer #4,784,111 Browse Full Index Next Integer #4,784,113 →