1,497,354

2 × 3 × 479 × 521

1,497,354 factors as 2 × 3 × 479 × 521. Its 16 positive divisors give a proper-divisor sum of 1,509,366, so this integer is abundant. The Collatz stopping time is 88 steps.

Prime Factor Structure

Factorization String 2 × 3 × 479 × 521

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 3,006,720

Proper Divisor Sum 1,509,366

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #1497347 ← → #1497359

Radix Representation

Decimal	1497354
Binary	101101101100100001010 (21 bits)
Octal	0o5554412
Hexadecimal	0x16D90A

Divisor Catalog (16)

1 2 3 6 479 521 958 1,042 1,437 1,563 2,874 3,126 249,559 499,118 748,677 1,497,354

Collatz Trajectory (88 steps to reach 1)

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

1,497,354 748,677 2,246,032 1,123,016 561,508 280,754 140,377 421,132 210,566 105,283 315,850 157,925 473,776 236,888 118,444 59,222 29,611 88,834 44,417 133,252 66,626 33,313 99,940 49,970 24,985 74,956 37,478 18,739 56,218 28,109 84,328 42,164 21,082 10,541 31,624 15,812 7,906 3,953 11,860 5,930 2,965 8,896 4,448 2,224 1,112 556 278 139 418 209 628 314 157 472 236 118 59 178 89 268

← Previous Integer #1,497,353 Browse Full Index Next Integer #1,497,355 →