4,993,632

2⁵ × 3² × 7 × 2477

4,993,632 factors as 2^5 × 3^2 × 7 × 2477. Its 72 positive divisors give a proper-divisor sum of 11,242,224, so this integer is abundant. The Collatz stopping time is 131 steps.

Prime Factor Structure

Factorization String 2^5 × 3^2 × 7 × 2477

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 72

Divisor Sum (σ) 16,235,856

Proper Divisor Sum 11,242,224

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #4993627 ← → #4993661

Radix Representation

Decimal	4993632
Binary	10011000011001001100000 (23 bits)
Octal	0o23031140
Hexadecimal	0x4C3260

Divisor Catalog (60 of 72)

1 2 3 4 6 7 8 9 12 14 16 18 21 24 28 32 36 42 48 56 63 72 84 96 112 126 144 168 224 252 288 336 504 672 1,008 2,016 2,477 4,954 7,431 9,908 14,862 17,339 19,816 22,293 29,724 34,678 39,632 44,586 52,017 59,448 69,356 79,264 89,172 104,034 118,896 138,712 156,051 178,344 208,068 237,792

Collatz Trajectory (131 steps to reach 1)

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

4,993,632 2,496,816 1,248,408 624,204 312,102 156,051 468,154 234,077 702,232 351,116 175,558 87,779 263,338 131,669 395,008 197,504 98,752 49,376 24,688 12,344 6,172 3,086 1,543 4,630 2,315 6,946 3,473 10,420 5,210 2,605 7,816 3,908 1,954 977 2,932 1,466 733 2,200 1,100 550 275 826 413 1,240 620 310 155 466 233 700 350 175 526 263 790 395 1,186 593 1,780 890

← Previous Integer #4,993,631 Browse Full Index Next Integer #4,993,633 →