1,414,962

2 × 3³ × 26203

1,414,962 factors as 2 × 3^3 × 26203. Its 16 positive divisors give a proper-divisor sum of 1,729,518, so this integer is abundant. The Collatz stopping time is 106 steps.

Prime Factor Structure

Factorization String 2 × 3^3 × 26203

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 3,144,480

Proper Divisor Sum 1,729,518

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #1414957 ← → #1414979

Radix Representation

Decimal	1414962
Binary	101011001011100110010 (21 bits)
Octal	0o5313462
Hexadecimal	0x159732

Divisor Catalog (16)

1 2 3 6 9 18 27 54 26,203 52,406 78,609 157,218 235,827 471,654 707,481 1,414,962

Collatz Trajectory (106 steps to reach 1)

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

1,414,962 707,481 2,122,444 1,061,222 530,611 1,591,834 795,917 2,387,752 1,193,876 596,938 298,469 895,408 447,704 223,852 111,926 55,963 167,890 83,945 251,836 125,918 62,959 188,878 94,439 283,318 141,659 424,978 212,489 637,468 318,734 159,367 478,102 239,051 717,154 358,577 1,075,732 537,866 268,933 806,800 403,400 201,700 100,850 50,425 151,276 75,638 37,819 113,458 56,729 170,188 85,094 42,547 127,642 63,821 191,464 95,732 47,866 23,933 71,800 35,900 17,950 8,975

← Previous Integer #1,414,961 Browse Full Index Next Integer #1,414,963 →