3,907,770

2 × 3 × 5 × 130259

3,907,770 factors as 2 × 3 × 5 × 130259. Its 16 positive divisors give a proper-divisor sum of 5,470,950, so this integer is abundant. The Collatz stopping time is 66 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5 × 130259

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 9,378,720

Proper Divisor Sum 5,470,950

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #3907733 ← → #3907777

Radix Representation

Decimal	3907770
Binary	1110111010000010111010 (22 bits)
Octal	0o16720272
Hexadecimal	0x3BA0BA

Divisor Catalog (16)

1 2 3 5 6 10 15 30 130,259 260,518 390,777 651,295 781,554 1,302,590 1,953,885 3,907,770

Collatz Trajectory (66 steps to reach 1)

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

3,907,770 1,953,885 5,861,656 2,930,828 1,465,414 732,707 2,198,122 1,099,061 3,297,184 1,648,592 824,296 412,148 206,074 103,037 309,112 154,556 77,278 38,639 115,918 57,959 173,878 86,939 260,818 130,409 391,228 195,614 97,807 293,422 146,711 440,134 220,067 660,202 330,101 990,304 495,152 247,576 123,788 61,894 30,947 92,842 46,421 139,264 69,632 34,816 17,408 8,704 4,352 2,176 1,088 544 272 136 68 34 17 52 26 13 40 20

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,907,769 Browse Full Index Next Integer #3,907,771 →