4,483,136

2⁶ × 7 × 10007

4,483,136 factors as 2^6 × 7 × 10007. Its 28 positive divisors give a proper-divisor sum of 5,684,992, so this integer is abundant. The Collatz stopping time is 255 steps.

Prime Factor Structure

Factorization String 2^6 × 7 × 10007

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 28

Divisor Sum (σ) 10,168,128

Proper Divisor Sum 5,684,992

Digit Sum / Digital Root 29 (Root: 2)

Adjacent Primes #4483123 ← → #4483147

Radix Representation

Decimal	4483136
Binary	10001000110100001000000 (23 bits)
Octal	0o21064100
Hexadecimal	0x446840

Divisor Catalog (28)

1 2 4 7 8 14 16 28 32 56 64 112 224 448 10,007 20,014 40,028 70,049 80,056 140,098 160,112 280,196 320,224 560,392 640,448 1,120,784 2,241,568 4,483,136

Collatz Trajectory (255 steps to reach 1)

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

4,483,136 2,241,568 1,120,784 560,392 280,196 140,098 70,049 210,148 105,074 52,537 157,612 78,806 39,403 118,210 59,105 177,316 88,658 44,329 132,988 66,494 33,247 99,742 49,871 149,614 74,807 224,422 112,211 336,634 168,317 504,952 252,476 126,238 63,119 189,358 94,679 284,038 142,019 426,058 213,029 639,088 319,544 159,772 79,886 39,943 119,830 59,915 179,746 89,873 269,620 134,810 67,405 202,216 101,108 50,554 25,277 75,832 37,916 18,958 9,479 28,438

← Previous Integer #4,483,135 Browse Full Index Next Integer #4,483,137 →