5,518,878

2 × 3 × 43 × 21391

5,518,878 factors as 2 × 3 × 43 × 21391. Its 16 positive divisors give a proper-divisor sum of 5,776,098, so this integer is abundant. The Collatz stopping time is 157 steps.

Prime Factor Structure

Factorization String 2 × 3 × 43 × 21391

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 11,294,976

Proper Divisor Sum 5,776,098

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #5518859 ← → #5518913

Radix Representation

Decimal	5518878
Binary	10101000011011000011110 (23 bits)
Octal	0o25033036
Hexadecimal	0x54361E

Divisor Catalog (16)

1 2 3 6 43 86 129 258 21,391 42,782 64,173 128,346 919,813 1,839,626 2,759,439 5,518,878

Collatz Trajectory (157 steps to reach 1)

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

5,518,878 2,759,439 8,278,318 4,139,159 12,417,478 6,208,739 18,626,218 9,313,109 27,939,328 13,969,664 6,984,832 3,492,416 1,746,208 873,104 436,552 218,276 109,138 54,569 163,708 81,854 40,927 122,782 61,391 184,174 92,087 276,262 138,131 414,394 207,197 621,592 310,796 155,398 77,699 233,098 116,549 349,648 174,824 87,412 43,706 21,853 65,560 32,780 16,390 8,195 24,586 12,293 36,880 18,440 9,220 4,610 2,305 6,916 3,458 1,729 5,188 2,594 1,297 3,892 1,946 973

← Previous Integer #5,518,877 Browse Full Index Next Integer #5,518,879 →