4,867,840

2⁸ × 5 × 3803

4,867,840 factors as 2^8 × 5 × 3803. Its 36 positive divisors give a proper-divisor sum of 6,795,224, so this integer is abundant. The Collatz stopping time is 69 steps.

Prime Factor Structure

Factorization String 2^8 × 5 × 3803

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 36

Divisor Sum (σ) 11,663,064

Proper Divisor Sum 6,795,224

Digit Sum / Digital Root 37 (Root: 1)

Adjacent Primes #4867823 ← → #4867843

Radix Representation

Decimal	4867840
Binary	10010100100011100000000 (23 bits)
Octal	0o22443400
Hexadecimal	0x4A4700

Divisor Catalog (36)

1 2 4 5 8 10 16 20 32 40 64 80 128 160 256 320 640 1,280 3,803 7,606 15,212 19,015 30,424 38,030 60,848 76,060 121,696 152,120 243,392 304,240 486,784 608,480 973,568 1,216,960 2,433,920 4,867,840

Collatz Trajectory (69 steps to reach 1)

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

4,867,840 2,433,920 1,216,960 608,480 304,240 152,120 76,060 38,030 19,015 57,046 28,523 85,570 42,785 128,356 64,178 32,089 96,268 48,134 24,067 72,202 36,101 108,304 54,152 27,076 13,538 6,769 20,308 10,154 5,077 15,232 7,616 3,808 1,904 952 476 238 119 358 179 538 269 808 404 202 101 304 152 76 38 19 58 29 88 44 22 11 34 17 52 26

← Previous Integer #4,867,839 Browse Full Index Next Integer #4,867,841 →