1,494,012

2² × 3 × 13 × 61 × 157

1,494,012 factors as 2^2 × 3 × 13 × 61 × 157. Its 48 positive divisors give a proper-divisor sum of 2,346,020, so this integer is abundant. The Collatz stopping time is 119 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 13 × 61 × 157

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 3,840,032

Proper Divisor Sum 2,346,020

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #1493981 ← → #1494019

Radix Representation

Decimal	1494012
Binary	101101100101111111100 (21 bits)
Octal	0o5545774
Hexadecimal	0x16CBFC

Divisor Catalog (48)

1 2 3 4 6 12 13 26 39 52 61 78 122 156 157 183 244 314 366 471 628 732 793 942 1,586 1,884 2,041 2,379 3,172 4,082 4,758 6,123 8,164 9,516 9,577 12,246 19,154 24,492 28,731 38,308 57,462 114,924 124,501 249,002 373,503 498,004 747,006 1,494,012

Collatz Trajectory (119 steps to reach 1)

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

1,494,012 747,006 373,503 1,120,510 560,255 1,680,766 840,383 2,521,150 1,260,575 3,781,726 1,890,863 5,672,590 2,836,295 8,508,886 4,254,443 12,763,330 6,381,665 19,144,996 9,572,498 4,786,249 14,358,748 7,179,374 3,589,687 10,769,062 5,384,531 16,153,594 8,076,797 24,230,392 12,115,196 6,057,598 3,028,799 9,086,398 4,543,199 13,629,598 6,814,799 20,444,398 10,222,199 30,666,598 15,333,299 45,999,898 22,999,949 68,999,848 34,499,924 17,249,962 8,624,981 25,874,944 12,937,472 6,468,736 3,234,368 1,617,184 808,592 404,296 202,148 101,074 50,537 151,612 75,806 37,903 113,710 56,855

← Previous Integer #1,494,011 Browse Full Index Next Integer #1,494,013 →