1,972,770

2 × 3 × 5 × 19 × 3461

1,972,770 factors as 2 × 3 × 5 × 19 × 3461. Its 32 positive divisors give a proper-divisor sum of 3,012,510, so this integer is abundant. The Collatz stopping time is 140 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5 × 19 × 3461

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 4,985,280

Proper Divisor Sum 3,012,510

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #1972741 ← → #1972777

Radix Representation

Decimal	1972770
Binary	111100001101000100010 (21 bits)
Octal	0o7415042
Hexadecimal	0x1E1A22

Divisor Catalog (32)

1 2 3 5 6 10 15 19 30 38 57 95 114 190 285 570 3,461 6,922 10,383 17,305 20,766 34,610 51,915 65,759 103,830 131,518 197,277 328,795 394,554 657,590 986,385 1,972,770

Collatz Trajectory (140 steps to reach 1)

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

1,972,770 986,385 2,959,156 1,479,578 739,789 2,219,368 1,109,684 554,842 277,421 832,264 416,132 208,066 104,033 312,100 156,050 78,025 234,076 117,038 58,519 175,558 87,779 263,338 131,669 395,008 197,504 98,752 49,376 24,688 12,344 6,172 3,086 1,543 4,630 2,315 6,946 3,473 10,420 5,210 2,605 7,816 3,908 1,954 977 2,932 1,466 733 2,200 1,100 550 275 826 413 1,240 620 310 155 466 233 700 350

← Previous Integer #1,972,769 Browse Full Index Next Integer #1,972,771 →