5,034,798

2 × 3⁴ × 31079

5,034,798 factors as 2 × 3^4 × 31079. Its 20 positive divisors give a proper-divisor sum of 6,247,242, so this integer is abundant. The Collatz stopping time is 56 steps.

Prime Factor Structure

Factorization String 2 × 3^4 × 31079

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 20

Divisor Sum (σ) 11,282,040

Proper Divisor Sum 6,247,242

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #5034797 ← → #5034811

Radix Representation

Decimal	5034798
Binary	10011001101001100101110 (23 bits)
Octal	0o23151456
Hexadecimal	0x4CD32E

Divisor Catalog (20)

1 2 3 6 9 18 27 54 81 162 31,079 62,158 93,237 186,474 279,711 559,422 839,133 1,678,266 2,517,399 5,034,798

Collatz Trajectory (56 steps to reach 1)

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

5,034,798 2,517,399 7,552,198 3,776,099 11,328,298 5,664,149 16,992,448 8,496,224 4,248,112 2,124,056 1,062,028 531,014 265,507 796,522 398,261 1,194,784 597,392 298,696 149,348 74,674 37,337 112,012 56,006 28,003 84,010 42,005 126,016 63,008 31,504 15,752 7,876 3,938 1,969 5,908 2,954 1,477 4,432 2,216 1,108 554 277 832 416 208 104 52 26 13 40 20 10 5 16 8 4 2 1

← Previous Integer #5,034,797 Browse Full Index Next Integer #5,034,799 →