8,909,877

3 × 2969959

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

Prime Factor Structure

Factorization String 3 × 2969959

Distinct Prime Factors 2

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 4

Divisor Sum (σ) 11,879,840

Proper Divisor Sum 2,969,963

Digit Sum / Digital Root 48 (Root: 3)

Adjacent Primes #8909867 ← → #8909881

Radix Representation

Decimal	8909877
Binary	100001111111010000110101 (24 bits)
Octal	0o41772065
Hexadecimal	0x87F435

Divisor Catalog (4)

1 3 2,969,959 8,909,877

Collatz Trajectory (212 steps to reach 1)

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

8,909,877 26,729,632 13,364,816 6,682,408 3,341,204 1,670,602 835,301 2,505,904 1,252,952 626,476 313,238 156,619 469,858 234,929 704,788 352,394 176,197 528,592 264,296 132,148 66,074 33,037 99,112 49,556 24,778 12,389 37,168 18,584 9,292 4,646 2,323 6,970 3,485 10,456 5,228 2,614 1,307 3,922 1,961 5,884 2,942 1,471 4,414 2,207 6,622 3,311 9,934 4,967 14,902 7,451 22,354 11,177 33,532 16,766 8,383 25,150 12,575 37,726 18,863 56,590

← Previous Integer #8,909,876 Browse Full Index Next Integer #8,909,878 →