4,209,990

2 × 3 × 5 × 140333

4,209,990 factors as 2 × 3 × 5 × 140333. Its 16 positive divisors give a proper-divisor sum of 5,894,058, so this integer is abundant. The Collatz stopping time is 167 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5 × 140333

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 10,104,048

Proper Divisor Sum 5,894,058

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #4209979 ← → #4209991

Radix Representation

Decimal	4209990
Binary	10000000011110101000110 (23 bits)
Octal	0o20036506
Hexadecimal	0x403D46

Divisor Catalog (16)

1 2 3 5 6 10 15 30 140,333 280,666 420,999 701,665 841,998 1,403,330 2,104,995 4,209,990

Collatz Trajectory (167 steps to reach 1)

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

4,209,990 2,104,995 6,314,986 3,157,493 9,472,480 4,736,240 2,368,120 1,184,060 592,030 296,015 888,046 444,023 1,332,070 666,035 1,998,106 999,053 2,997,160 1,498,580 749,290 374,645 1,123,936 561,968 280,984 140,492 70,246 35,123 105,370 52,685 158,056 79,028 39,514 19,757 59,272 29,636 14,818 7,409 22,228 11,114 5,557 16,672 8,336 4,168 2,084 1,042 521 1,564 782 391 1,174 587 1,762 881 2,644 1,322 661 1,984 992 496 248 124

← Previous Integer #4,209,989 Browse Full Index Next Integer #4,209,991 →