2,907,296

2⁵ × 7 × 12979

2,907,296 factors as 2^5 × 7 × 12979. Its 24 positive divisors give a proper-divisor sum of 3,634,624, so this integer is abundant. The Collatz stopping time is 50 steps.

Prime Factor Structure

Factorization String 2^5 × 7 × 12979

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 6,541,920

Proper Divisor Sum 3,634,624

Digit Sum / Digital Root 35 (Root: 8)

Adjacent Primes #2907293 ← → #2907301

Radix Representation

Decimal	2907296
Binary	1011000101110010100000 (22 bits)
Octal	0o13056240
Hexadecimal	0x2C5CA0

Divisor Catalog (24)

1 2 4 7 8 14 16 28 32 56 112 224 12,979 25,958 51,916 90,853 103,832 181,706 207,664 363,412 415,328 726,824 1,453,648 2,907,296

Collatz Trajectory (50 steps to reach 1)

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

2,907,296 1,453,648 726,824 363,412 181,706 90,853 272,560 136,280 68,140 34,070 17,035 51,106 25,553 76,660 38,330 19,165 57,496 28,748 14,374 7,187 21,562 10,781 32,344 16,172 8,086 4,043 12,130 6,065 18,196 9,098 4,549 13,648 6,824 3,412 1,706 853 2,560 1,280 640 320 160 80 40 20 10 5 16 8 4 2 1

← Previous Integer #2,907,295 Browse Full Index Next Integer #2,907,297 →