1,399,450

2 × 5² × 13 × 2153

1,399,450 factors as 2 × 5^2 × 13 × 2153. Its 24 positive divisors give a proper-divisor sum of 1,405,058, so this integer is abundant. The Collatz stopping time is 106 steps.

Prime Factor Structure

Factorization String 2 × 5^2 × 13 × 2153

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 2,804,508

Proper Divisor Sum 1,405,058

Digit Sum / Digital Root 31 (Root: 4)

Adjacent Primes #1399441 ← → #1399469

Radix Representation

Decimal	1399450
Binary	101010101101010011010 (21 bits)
Octal	0o5255232
Hexadecimal	0x155A9A

Divisor Catalog (24)

1 2 5 10 13 25 26 50 65 130 325 650 2,153 4,306 10,765 21,530 27,989 53,825 55,978 107,650 139,945 279,890 699,725 1,399,450

Collatz Trajectory (106 steps to reach 1)

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

1,399,450 699,725 2,099,176 1,049,588 524,794 262,397 787,192 393,596 196,798 98,399 295,198 147,599 442,798 221,399 664,198 332,099 996,298 498,149 1,494,448 747,224 373,612 186,806 93,403 280,210 140,105 420,316 210,158 105,079 315,238 157,619 472,858 236,429 709,288 354,644 177,322 88,661 265,984 132,992 66,496 33,248 16,624 8,312 4,156 2,078 1,039 3,118 1,559 4,678 2,339 7,018 3,509 10,528 5,264 2,632 1,316 658 329 988 494 247

← Previous Integer #1,399,449 Browse Full Index Next Integer #1,399,451 →