4,624,926

2 × 3 × 37 × 83 × 251

4,624,926 factors as 2 × 3 × 37 × 83 × 251. Its 32 positive divisors give a proper-divisor sum of 5,027,682, so this integer is abundant. The Collatz stopping time is 193 steps.

Prime Factor Structure

Factorization String 2 × 3 × 37 × 83 × 251

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 9,652,608

Proper Divisor Sum 5,027,682

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #4624913 ← → #4624931

Radix Representation

Decimal	4624926
Binary	10001101001001000011110 (23 bits)
Octal	0o21511036
Hexadecimal	0x46921E

Divisor Catalog (32)

1 2 3 6 37 74 83 111 166 222 249 251 498 502 753 1,506 3,071 6,142 9,213 9,287 18,426 18,574 20,833 27,861 41,666 55,722 62,499 124,998 770,821 1,541,642 2,312,463 4,624,926

Collatz Trajectory (193 steps to reach 1)

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

4,624,926 2,312,463 6,937,390 3,468,695 10,406,086 5,203,043 15,609,130 7,804,565 23,413,696 11,706,848 5,853,424 2,926,712 1,463,356 731,678 365,839 1,097,518 548,759 1,646,278 823,139 2,469,418 1,234,709 3,704,128 1,852,064 926,032 463,016 231,508 115,754 57,877 173,632 86,816 43,408 21,704 10,852 5,426 2,713 8,140 4,070 2,035 6,106 3,053 9,160 4,580 2,290 1,145 3,436 1,718 859 2,578 1,289 3,868 1,934 967 2,902 1,451 4,354 2,177 6,532 3,266 1,633 4,900

← Previous Integer #4,624,925 Browse Full Index Next Integer #4,624,927 →