1,599,456

2⁵ × 3 × 16661

1,599,456 factors as 2^5 × 3 × 16661. Its 24 positive divisors give a proper-divisor sum of 2,599,368, so this integer is abundant. The Collatz stopping time is 93 steps.

Prime Factor Structure

Factorization String 2^5 × 3 × 16661

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 4,198,824

Proper Divisor Sum 2,599,368

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #1599449 ← → #1599461

Radix Representation

Decimal	1599456
Binary	110000110011111100000 (21 bits)
Octal	0o6063740
Hexadecimal	0x1867E0

Divisor Catalog (24)

1 2 3 4 6 8 12 16 24 32 48 96 16,661 33,322 49,983 66,644 99,966 133,288 199,932 266,576 399,864 533,152 799,728 1,599,456

Collatz Trajectory (93 steps to reach 1)

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

1,599,456 799,728 399,864 199,932 99,966 49,983 149,950 74,975 224,926 112,463 337,390 168,695 506,086 253,043 759,130 379,565 1,138,696 569,348 284,674 142,337 427,012 213,506 106,753 320,260 160,130 80,065 240,196 120,098 60,049 180,148 90,074 45,037 135,112 67,556 33,778 16,889 50,668 25,334 12,667 38,002 19,001 57,004 28,502 14,251 42,754 21,377 64,132 32,066 16,033 48,100 24,050 12,025 36,076 18,038 9,019 27,058 13,529 40,588 20,294 10,147

← Previous Integer #1,599,455 Browse Full Index Next Integer #1,599,457 →