11,620,458

2 × 3² × 645581

11,620,458 factors as 2 × 3^2 × 645581. Its 12 positive divisors give a proper-divisor sum of 13,557,240, so this integer is abundant. The Collatz stopping time is 215 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 645581

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 25,177,698

Proper Divisor Sum 13,557,240

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #11620447 ← → #11620459

Radix Representation

Decimal	11620458
Binary	101100010101000001101010 (24 bits)
Octal	0o54250152
Hexadecimal	0xB1506A

Divisor Catalog (12)

1 2 3 6 9 18 645,581 1,291,162 1,936,743 3,873,486 5,810,229 11,620,458

Collatz Trajectory (215 steps to reach 1)

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

11,620,458 5,810,229 17,430,688 8,715,344 4,357,672 2,178,836 1,089,418 544,709 1,634,128 817,064 408,532 204,266 102,133 306,400 153,200 76,600 38,300 19,150 9,575 28,726 14,363 43,090 21,545 64,636 32,318 16,159 48,478 24,239 72,718 36,359 109,078 54,539 163,618 81,809 245,428 122,714 61,357 184,072 92,036 46,018 23,009 69,028 34,514 17,257 51,772 25,886 12,943 38,830 19,415 58,246 29,123 87,370 43,685 131,056 65,528 32,764 16,382 8,191 24,574 12,287

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #11,620,457 Browse Full Index Next Integer #11,620,459 →