4,405,882

2 × 13 × 169457

4,405,882 factors as 2 × 13 × 169457. Its 8 positive divisors give a proper-divisor sum of 2,711,354, so this integer is deficient. The Collatz stopping time is 87 steps.

Prime Factor Structure

Factorization String 2 × 13 × 169457

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 7,117,236

Proper Divisor Sum 2,711,354

Digit Sum / Digital Root 31 (Root: 4)

Adjacent Primes #4405879 ← → #4405913

Radix Representation

Decimal	4405882
Binary	10000110011101001111010 (23 bits)
Octal	0o20635172
Hexadecimal	0x433A7A

Divisor Catalog (8)

1 2 13 26 169,457 338,914 2,202,941 4,405,882

Collatz Trajectory (87 steps to reach 1)

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

4,405,882 2,202,941 6,608,824 3,304,412 1,652,206 826,103 2,478,310 1,239,155 3,717,466 1,858,733 5,576,200 2,788,100 1,394,050 697,025 2,091,076 1,045,538 522,769 1,568,308 784,154 392,077 1,176,232 588,116 294,058 147,029 441,088 220,544 110,272 55,136 27,568 13,784 6,892 3,446 1,723 5,170 2,585 7,756 3,878 1,939 5,818 2,909 8,728 4,364 2,182 1,091 3,274 1,637 4,912 2,456 1,228 614 307 922 461 1,384 692 346 173 520 260 130

← Previous Integer #4,405,881 Browse Full Index Next Integer #4,405,883 →