2,910,684

2² × 3 × 7 × 34651

2,910,684 factors as 2^2 × 3 × 7 × 34651. Its 24 positive divisors give a proper-divisor sum of 4,851,364, so this integer is abundant. The Collatz stopping time is 138 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 7 × 34651

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 7,762,048

Proper Divisor Sum 4,851,364

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #2910671 ← → #2910697

Radix Representation

Decimal	2910684
Binary	1011000110100111011100 (22 bits)
Octal	0o13064734
Hexadecimal	0x2C69DC

Divisor Catalog (24)

Collatz Trajectory (138 steps to reach 1)

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

2,910,684 1,455,342 727,671 2,183,014 1,091,507 3,274,522 1,637,261 4,911,784 2,455,892 1,227,946 613,973 1,841,920 920,960 460,480 230,240 115,120 57,560 28,780 14,390 7,195 21,586 10,793 32,380 16,190 8,095 24,286 12,143 36,430 18,215 54,646 27,323 81,970 40,985 122,956 61,478 30,739 92,218 46,109 138,328 69,164 34,582 17,291 51,874 25,937 77,812 38,906 19,453 58,360 29,180 14,590 7,295 21,886 10,943 32,830 16,415 49,246 24,623 73,870 36,935 110,806

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,910,683 Browse Full Index Next Integer #2,910,685 →