5,139,384

2³ × 3 × 214141

5,139,384 factors as 2^3 × 3 × 214141. Its 16 positive divisors give a proper-divisor sum of 7,709,136, so this integer is abundant. The Collatz stopping time is 219 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 214141

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 12,848,520

Proper Divisor Sum 7,709,136

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #5139383 ← → #5139401

Radix Representation

Decimal	5139384
Binary	10011100110101110111000 (23 bits)
Octal	0o23465670
Hexadecimal	0x4E6BB8

Divisor Catalog (16)

1 2 3 4 6 8 12 24 214,141 428,282 642,423 856,564 1,284,846 1,713,128 2,569,692 5,139,384

Collatz Trajectory (219 steps to reach 1)

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

5,139,384 2,569,692 1,284,846 642,423 1,927,270 963,635 2,890,906 1,445,453 4,336,360 2,168,180 1,084,090 542,045 1,626,136 813,068 406,534 203,267 609,802 304,901 914,704 457,352 228,676 114,338 57,169 171,508 85,754 42,877 128,632 64,316 32,158 16,079 48,238 24,119 72,358 36,179 108,538 54,269 162,808 81,404 40,702 20,351 61,054 30,527 91,582 45,791 137,374 68,687 206,062 103,031 309,094 154,547 463,642 231,821 695,464 347,732 173,866 86,933 260,800 130,400 65,200 32,600

← Previous Integer #5,139,383 Browse Full Index Next Integer #5,139,385 →