2,679,080

2³ × 5 × 66977

2,679,080 factors as 2^3 × 5 × 66977. Its 16 positive divisors give a proper-divisor sum of 3,348,940, so this integer is abundant. The Collatz stopping time is 187 steps.

Prime Factor Structure

Factorization String 2^3 × 5 × 66977

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 6,028,020

Proper Divisor Sum 3,348,940

Digit Sum / Digital Root 32 (Root: 5)

Adjacent Primes #2679077 ← → #2679091

Radix Representation

Decimal	2679080
Binary	1010001110000100101000 (22 bits)
Octal	0o12160450
Hexadecimal	0x28E128

Divisor Catalog (16)

1 2 4 5 8 10 20 40 66,977 133,954 267,908 334,885 535,816 669,770 1,339,540 2,679,080

Collatz Trajectory (187 steps to reach 1)

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

2,679,080 1,339,540 669,770 334,885 1,004,656 502,328 251,164 125,582 62,791 188,374 94,187 282,562 141,281 423,844 211,922 105,961 317,884 158,942 79,471 238,414 119,207 357,622 178,811 536,434 268,217 804,652 402,326 201,163 603,490 301,745 905,236 452,618 226,309 678,928 339,464 169,732 84,866 42,433 127,300 63,650 31,825 95,476 47,738 23,869 71,608 35,804 17,902 8,951 26,854 13,427 40,282 20,141 60,424 30,212 15,106 7,553 22,660 11,330 5,665 16,996

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,679,079 Browse Full Index Next Integer #2,679,081 →