2,969,877

3 × 989959

2,969,877 factors as 3 × 989959. Its 4 positive divisors give a proper-divisor sum of 989,963, so this integer is deficient. The Collatz stopping time is 89 steps.

Prime Factor Structure

Factorization String 3 × 989959

Distinct Prime Factors 2

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 4

Divisor Sum (σ) 3,959,840

Proper Divisor Sum 989,963

Digit Sum / Digital Root 48 (Root: 3)

Adjacent Primes #2969867 ← → #2969887

Radix Representation

Decimal	2969877
Binary	1011010101000100010101 (22 bits)
Octal	0o13250425
Hexadecimal	0x2D5115

Divisor Catalog (4)

1 3 989,959 2,969,877

Collatz Trajectory (89 steps to reach 1)

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

2,969,877 8,909,632 4,454,816 2,227,408 1,113,704 556,852 278,426 139,213 417,640 208,820 104,410 52,205 156,616 78,308 39,154 19,577 58,732 29,366 14,683 44,050 22,025 66,076 33,038 16,519 49,558 24,779 74,338 37,169 111,508 55,754 27,877 83,632 41,816 20,908 10,454 5,227 15,682 7,841 23,524 11,762 5,881 17,644 8,822 4,411 13,234 6,617 19,852 9,926 4,963 14,890 7,445 22,336 11,168 5,584 2,792 1,396 698 349 1,048 524

← Previous Integer #2,969,876 Browse Full Index Next Integer #2,969,878 →