2,995,640

2³ × 5 × 74891

2,995,640 factors as 2^3 × 5 × 74891. Its 16 positive divisors give a proper-divisor sum of 3,744,640, so this integer is abundant. The Collatz stopping time is 151 steps.

Prime Factor Structure

Factorization String 2^3 × 5 × 74891

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 6,740,280

Proper Divisor Sum 3,744,640

Digit Sum / Digital Root 35 (Root: 8)

Adjacent Primes #2995633 ← → #2995661

Radix Representation

Decimal	2995640
Binary	1011011011010110111000 (22 bits)
Octal	0o13332670
Hexadecimal	0x2DB5B8

Divisor Catalog (16)

1 2 4 5 8 10 20 40 74,891 149,782 299,564 374,455 599,128 748,910 1,497,820 2,995,640

Collatz Trajectory (151 steps to reach 1)

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

2,995,640 1,497,820 748,910 374,455 1,123,366 561,683 1,685,050 842,525 2,527,576 1,263,788 631,894 315,947 947,842 473,921 1,421,764 710,882 355,441 1,066,324 533,162 266,581 799,744 399,872 199,936 99,968 49,984 24,992 12,496 6,248 3,124 1,562 781 2,344 1,172 586 293 880 440 220 110 55 166 83 250 125 376 188 94 47 142 71 214 107 322 161 484 242 121 364 182 91

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,995,639 Browse Full Index Next Integer #2,995,641 →