5,437,480

2³ × 5 × 135937

5,437,480 factors as 2^3 × 5 × 135937. Its 16 positive divisors give a proper-divisor sum of 6,796,940, so this integer is abundant. The Collatz stopping time is 108 steps.

Prime Factor Structure

Factorization String 2^3 × 5 × 135937

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 12,234,420

Proper Divisor Sum 6,796,940

Digit Sum / Digital Root 31 (Root: 4)

Adjacent Primes #5437469 ← → #5437507

Radix Representation

Decimal	5437480
Binary	10100101111100000101000 (23 bits)
Octal	0o24574050
Hexadecimal	0x52F828

Divisor Catalog (16)

1 2 4 5 8 10 20 40 135,937 271,874 543,748 679,685 1,087,496 1,359,370 2,718,740 5,437,480

Collatz Trajectory (108 steps to reach 1)

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

5,437,480 2,718,740 1,359,370 679,685 2,039,056 1,019,528 509,764 254,882 127,441 382,324 191,162 95,581 286,744 143,372 71,686 35,843 107,530 53,765 161,296 80,648 40,324 20,162 10,081 30,244 15,122 7,561 22,684 11,342 5,671 17,014 8,507 25,522 12,761 38,284 19,142 9,571 28,714 14,357 43,072 21,536 10,768 5,384 2,692 1,346 673 2,020 1,010 505 1,516 758 379 1,138 569 1,708 854 427 1,282 641 1,924 962

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #5,437,479 Browse Full Index Next Integer #5,437,481 →