4,606,290

2 × 3² × 5 × 13 × 31 × 127

4,606,290 factors as 2 × 3^2 × 5 × 13 × 31 × 127. Its 96 positive divisors give a proper-divisor sum of 8,812,206, so this integer is abundant. The Collatz stopping time is 162 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 5 × 13 × 31 × 127

Distinct Prime Factors 6

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 96

Divisor Sum (σ) 13,418,496

Proper Divisor Sum 8,812,206

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #4606249 ← → #4606313

Radix Representation

Decimal	4606290
Binary	10001100100100101010010 (23 bits)
Octal	0o21444522
Hexadecimal	0x464952

Divisor Catalog (60 of 96)

1 2 3 5 6 9 10 13 15 18 26 30 31 39 45 62 65 78 90 93 117 127 130 155 186 195 234 254 279 310 381 390 403 465 558 585 635 762 806 930 1,143 1,170 1,209 1,270 1,395 1,651 1,905 2,015 2,286 2,418 2,790 3,302 3,627 3,810 3,937 4,030 4,953 5,715 6,045 7,254

Collatz Trajectory (162 steps to reach 1)

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

4,606,290 2,303,145 6,909,436 3,454,718 1,727,359 5,182,078 2,591,039 7,773,118 3,886,559 11,659,678 5,829,839 17,489,518 8,744,759 26,234,278 13,117,139 39,351,418 19,675,709 59,027,128 29,513,564 14,756,782 7,378,391 22,135,174 11,067,587 33,202,762 16,601,381 49,804,144 24,902,072 12,451,036 6,225,518 3,112,759 9,338,278 4,669,139 14,007,418 7,003,709 21,011,128 10,505,564 5,252,782 2,626,391 7,879,174 3,939,587 11,818,762 5,909,381 17,728,144 8,864,072 4,432,036 2,216,018 1,108,009 3,324,028 1,662,014 831,007 2,493,022 1,246,511 3,739,534 1,869,767 5,609,302 2,804,651 8,413,954 4,206,977 12,620,932 6,310,466

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,606,289 Browse Full Index Next Integer #4,606,291 →