4,549,152

2⁵ × 3 × 47387

4,549,152 factors as 2^5 × 3 × 47387. Its 24 positive divisors give a proper-divisor sum of 7,392,624, so this integer is abundant. The Collatz stopping time is 87 steps.

Prime Factor Structure

Factorization String 2^5 × 3 × 47387

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 11,941,776

Proper Divisor Sum 7,392,624

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #4549133 ← → #4549159

Radix Representation

Decimal	4549152
Binary	10001010110101000100000 (23 bits)
Octal	0o21265040
Hexadecimal	0x456A20

Divisor Catalog (24)

1 2 3 4 6 8 12 16 24 32 48 96 47,387 94,774 142,161 189,548 284,322 379,096 568,644 758,192 1,137,288 1,516,384 2,274,576 4,549,152

Collatz Trajectory (87 steps to reach 1)

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

4,549,152 2,274,576 1,137,288 568,644 284,322 142,161 426,484 213,242 106,621 319,864 159,932 79,966 39,983 119,950 59,975 179,926 89,963 269,890 134,945 404,836 202,418 101,209 303,628 151,814 75,907 227,722 113,861 341,584 170,792 85,396 42,698 21,349 64,048 32,024 16,012 8,006 4,003 12,010 6,005 18,016 9,008 4,504 2,252 1,126 563 1,690 845 2,536 1,268 634 317 952 476 238 119 358 179 538 269 808

← Previous Integer #4,549,151 Browse Full Index Next Integer #4,549,153 →