4,627,064

2³ × 13 × 44491

4,627,064 factors as 2^3 × 13 × 44491. Its 16 positive divisors give a proper-divisor sum of 4,716,256, so this integer is abundant. The Collatz stopping time is 193 steps.

Prime Factor Structure

Factorization String 2^3 × 13 × 44491

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 9,343,320

Proper Divisor Sum 4,716,256

Digit Sum / Digital Root 29 (Root: 2)

Adjacent Primes #4627061 ← → #4627067

Radix Representation

Decimal	4627064
Binary	10001101001101001111000 (23 bits)
Octal	0o21515170
Hexadecimal	0x469A78

Divisor Catalog (16)

1 2 4 8 13 26 52 104 44,491 88,982 177,964 355,928 578,383 1,156,766 2,313,532 4,627,064

Collatz Trajectory (193 steps to reach 1)

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

4,627,064 2,313,532 1,156,766 578,383 1,735,150 867,575 2,602,726 1,301,363 3,904,090 1,952,045 5,856,136 2,928,068 1,464,034 732,017 2,196,052 1,098,026 549,013 1,647,040 823,520 411,760 205,880 102,940 51,470 25,735 77,206 38,603 115,810 57,905 173,716 86,858 43,429 130,288 65,144 32,572 16,286 8,143 24,430 12,215 36,646 18,323 54,970 27,485 82,456 41,228 20,614 10,307 30,922 15,461 46,384 23,192 11,596 5,798 2,899 8,698 4,349 13,048 6,524 3,262 1,631 4,894

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,627,063 Browse Full Index Next Integer #4,627,065 →