1,398,408

2³ × 3 × 11 × 5297

1,398,408 factors as 2^3 × 3 × 11 × 5297. Its 32 positive divisors give a proper-divisor sum of 2,416,152, so this integer is abundant. The Collatz stopping time is 62 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 11 × 5297

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 3,814,560

Proper Divisor Sum 2,416,152

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #1398407 ← → #1398413

Radix Representation

Decimal	1398408
Binary	101010101011010001000 (21 bits)
Octal	0o5253210
Hexadecimal	0x155688

Divisor Catalog (32)

1 2 3 4 6 8 11 12 22 24 33 44 66 88 132 264 5,297 10,594 15,891 21,188 31,782 42,376 58,267 63,564 116,534 127,128 174,801 233,068 349,602 466,136 699,204 1,398,408

Collatz Trajectory (62 steps to reach 1)

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

1,398,408 699,204 349,602 174,801 524,404 262,202 131,101 393,304 196,652 98,326 49,163 147,490 73,745 221,236 110,618 55,309 165,928 82,964 41,482 20,741 62,224 31,112 15,556 7,778 3,889 11,668 5,834 2,917 8,752 4,376 2,188 1,094 547 1,642 821 2,464 1,232 616 308 154 77 232 116 58 29 88 44 22 11 34 17 52 26 13 40 20 10 5 16 8

← Previous Integer #1,398,407 Browse Full Index Next Integer #1,398,409 →