2,940,488

2³ × 367561

2,940,488 factors as 2^3 × 367561. Its 8 positive divisors give a proper-divisor sum of 2,572,942, so this integer is deficient. The Collatz stopping time is 76 steps.

Prime Factor Structure

Factorization String 2^3 × 367561

Distinct Prime Factors 2

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 5,513,430

Proper Divisor Sum 2,572,942

Digit Sum / Digital Root 35 (Root: 8)

Adjacent Primes #2940449 ← → #2940517

Radix Representation

Decimal	2940488
Binary	1011001101111001001000 (22 bits)
Octal	0o13157110
Hexadecimal	0x2CDE48

Divisor Catalog (8)

1 2 4 8 367,561 735,122 1,470,244 2,940,488

Collatz Trajectory (76 steps to reach 1)

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

2,940,488 1,470,244 735,122 367,561 1,102,684 551,342 275,671 827,014 413,507 1,240,522 620,261 1,860,784 930,392 465,196 232,598 116,299 348,898 174,449 523,348 261,674 130,837 392,512 196,256 98,128 49,064 24,532 12,266 6,133 18,400 9,200 4,600 2,300 1,150 575 1,726 863 2,590 1,295 3,886 1,943 5,830 2,915 8,746 4,373 13,120 6,560 3,280 1,640 820 410 205 616 308 154 77 232 116 58 29 88

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,940,487 Browse Full Index Next Integer #2,940,489 →