4,065,402

2 × 3 × 11 × 31 × 1987

4,065,402 factors as 2 × 3 × 11 × 31 × 1987. Its 32 positive divisors give a proper-divisor sum of 5,095,302, so this integer is abundant. The Collatz stopping time is 110 steps.

Prime Factor Structure

Factorization String 2 × 3 × 11 × 31 × 1987

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 9,160,704

Proper Divisor Sum 5,095,302

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #4065379 ← → #4065403

Radix Representation

Decimal	4065402
Binary	1111100000100001111010 (22 bits)
Octal	0o17404172
Hexadecimal	0x3E087A

Divisor Catalog (32)

1 2 3 6 11 22 31 33 62 66 93 186 341 682 1,023 1,987 2,046 3,974 5,961 11,922 21,857 43,714 61,597 65,571 123,194 131,142 184,791 369,582 677,567 1,355,134 2,032,701 4,065,402

Collatz Trajectory (110 steps to reach 1)

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

4,065,402 2,032,701 6,098,104 3,049,052 1,524,526 762,263 2,286,790 1,143,395 3,430,186 1,715,093 5,145,280 2,572,640 1,286,320 643,160 321,580 160,790 80,395 241,186 120,593 361,780 180,890 90,445 271,336 135,668 67,834 33,917 101,752 50,876 25,438 12,719 38,158 19,079 57,238 28,619 85,858 42,929 128,788 64,394 32,197 96,592 48,296 24,148 12,074 6,037 18,112 9,056 4,528 2,264 1,132 566 283 850 425 1,276 638 319 958 479 1,438 719

← Previous Integer #4,065,401 Browse Full Index Next Integer #4,065,403 →