5,243,970

2 × 3 × 5 × 174799

5,243,970 factors as 2 × 3 × 5 × 174799. Its 16 positive divisors give a proper-divisor sum of 7,341,630, so this integer is abundant. The Collatz stopping time is 188 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5 × 174799

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 12,585,600

Proper Divisor Sum 7,341,630

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #5243947 ← → #5243971

Radix Representation

Decimal	5243970
Binary	10100000000010001000010 (23 bits)
Octal	0o24002102
Hexadecimal	0x500442

Divisor Catalog (16)

1 2 3 5 6 10 15 30 174,799 349,598 524,397 873,995 1,048,794 1,747,990 2,621,985 5,243,970

Collatz Trajectory (188 steps to reach 1)

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

5,243,970 2,621,985 7,865,956 3,932,978 1,966,489 5,899,468 2,949,734 1,474,867 4,424,602 2,212,301 6,636,904 3,318,452 1,659,226 829,613 2,488,840 1,244,420 622,210 311,105 933,316 466,658 233,329 699,988 349,994 174,997 524,992 262,496 131,248 65,624 32,812 16,406 8,203 24,610 12,305 36,916 18,458 9,229 27,688 13,844 6,922 3,461 10,384 5,192 2,596 1,298 649 1,948 974 487 1,462 731 2,194 1,097 3,292 1,646 823 2,470 1,235 3,706 1,853 5,560

← Previous Integer #5,243,969 Browse Full Index Next Integer #5,243,971 →