1,250,712

2³ × 3² × 29 × 599

1,250,712 factors as 2^3 × 3^2 × 29 × 599. Its 48 positive divisors give a proper-divisor sum of 2,259,288, so this integer is abundant. The Collatz stopping time is 173 steps.

Prime Factor Structure

Factorization String 2^3 × 3^2 × 29 × 599

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 3,510,000

Proper Divisor Sum 2,259,288

Digit Sum / Digital Root 18 (Root: 9)

Adjacent Primes #1250701 ← → #1250737

Radix Representation

Decimal	1250712
Binary	100110001010110011000 (21 bits)
Octal	0o4612630
Hexadecimal	0x131598

Divisor Catalog (48)

1 2 3 4 6 8 9 12 18 24 29 36 58 72 87 116 174 232 261 348 522 599 696 1,044 1,198 1,797 2,088 2,396 3,594 4,792 5,391 7,188 10,782 14,376 17,371 21,564 34,742 43,128 52,113 69,484 104,226 138,968 156,339 208,452 312,678 416,904 625,356 1,250,712

Collatz Trajectory (173 steps to reach 1)

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

1,250,712 625,356 312,678 156,339 469,018 234,509 703,528 351,764 175,882 87,941 263,824 131,912 65,956 32,978 16,489 49,468 24,734 12,367 37,102 18,551 55,654 27,827 83,482 41,741 125,224 62,612 31,306 15,653 46,960 23,480 11,740 5,870 2,935 8,806 4,403 13,210 6,605 19,816 9,908 4,954 2,477 7,432 3,716 1,858 929 2,788 1,394 697 2,092 1,046 523 1,570 785 2,356 1,178 589 1,768 884 442 221

← Previous Integer #1,250,711 Browse Full Index Next Integer #1,250,713 →