3,962,004

2² × 3 × 330167

3,962,004 factors as 2^2 × 3 × 330167. Its 12 positive divisors give a proper-divisor sum of 5,282,700, so this integer is abundant. The Collatz stopping time is 185 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 330167

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 9,244,704

Proper Divisor Sum 5,282,700

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #3961987 ← → #3962029

Radix Representation

Decimal	3962004
Binary	1111000111010010010100 (22 bits)
Octal	0o17072224
Hexadecimal	0x3C7494

Divisor Catalog (12)

1 2 3 4 6 12 330,167 660,334 990,501 1,320,668 1,981,002 3,962,004

Collatz Trajectory (185 steps to reach 1)

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

3,962,004 1,981,002 990,501 2,971,504 1,485,752 742,876 371,438 185,719 557,158 278,579 835,738 417,869 1,253,608 626,804 313,402 156,701 470,104 235,052 117,526 58,763 176,290 88,145 264,436 132,218 66,109 198,328 99,164 49,582 24,791 74,374 37,187 111,562 55,781 167,344 83,672 41,836 20,918 10,459 31,378 15,689 47,068 23,534 11,767 35,302 17,651 52,954 26,477 79,432 39,716 19,858 9,929 29,788 14,894 7,447 22,342 11,171 33,514 16,757 50,272 25,136

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,962,003 Browse Full Index Next Integer #3,962,005 →