1,277,370

2 × 3⁴ × 5 × 19 × 83

1,277,370 factors as 2 × 3^4 × 5 × 19 × 83. Its 80 positive divisors give a proper-divisor sum of 2,381,670, so this integer is abundant. The Collatz stopping time is 111 steps.

Prime Factor Structure

Factorization String 2 × 3^4 × 5 × 19 × 83

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 80

Divisor Sum (σ) 3,659,040

Proper Divisor Sum 2,381,670

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #1277369 ← → #1277387

Radix Representation

Decimal	1277370
Binary	100110111110110111010 (21 bits)
Octal	0o4676672
Hexadecimal	0x137DBA

Divisor Catalog (60 of 80)

1 2 3 5 6 9 10 15 18 19 27 30 38 45 54 57 81 83 90 95 114 135 162 166 171 190 249 270 285 342 405 415 498 513 570 747 810 830 855 1,026 1,245 1,494 1,539 1,577 1,710 2,241 2,490 2,565 3,078 3,154 3,735 4,482 4,731 5,130 6,723 7,470 7,695 7,885 9,462 11,205

Collatz Trajectory (111 steps to reach 1)

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

1,277,370 638,685 1,916,056 958,028 479,014 239,507 718,522 359,261 1,077,784 538,892 269,446 134,723 404,170 202,085 606,256 303,128 151,564 75,782 37,891 113,674 56,837 170,512 85,256 42,628 21,314 10,657 31,972 15,986 7,993 23,980 11,990 5,995 17,986 8,993 26,980 13,490 6,745 20,236 10,118 5,059 15,178 7,589 22,768 11,384 5,692 2,846 1,423 4,270 2,135 6,406 3,203 9,610 4,805 14,416 7,208 3,604 1,802 901 2,704 1,352

← Previous Integer #1,277,369 Browse Full Index Next Integer #1,277,371 →