1,356,500

2² × 5³ × 2713

1,356,500 factors as 2^2 × 5^3 × 2713. Its 24 positive divisors give a proper-divisor sum of 1,607,188, so this integer is abundant. The Collatz stopping time is 62 steps.

Prime Factor Structure

Factorization String 2^2 × 5^3 × 2713

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 2,963,688

Proper Divisor Sum 1,607,188

Digit Sum / Digital Root 20 (Root: 2)

Adjacent Primes #1356499 ← → #1356503

Radix Representation

Decimal	1356500
Binary	101001011001011010100 (21 bits)
Octal	0o5131324
Hexadecimal	0x14B2D4

Divisor Catalog (24)

1 2 4 5 10 20 25 50 100 125 250 500 2,713 5,426 10,852 13,565 27,130 54,260 67,825 135,650 271,300 339,125 678,250 1,356,500

Collatz Trajectory (62 steps to reach 1)

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

1,356,500 678,250 339,125 1,017,376 508,688 254,344 127,172 63,586 31,793 95,380 47,690 23,845 71,536 35,768 17,884 8,942 4,471 13,414 6,707 20,122 10,061 30,184 15,092 7,546 3,773 11,320 5,660 2,830 1,415 4,246 2,123 6,370 3,185 9,556 4,778 2,389 7,168 3,584 1,792 896 448 224 112 56 28 14 7 22 11 34 17 52 26 13 40 20 10 5 16 8

← Previous Integer #1,356,499 Browse Full Index Next Integer #1,356,501 →