1,590,039

3² × 11 × 16061

1,590,039 factors as 3^2 × 11 × 16061. Its 12 positive divisors give a proper-divisor sum of 915,633, so this integer is deficient. The Collatz stopping time is 101 steps.

Prime Factor Structure

Factorization String 3^2 × 11 × 16061

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 2,505,672

Proper Divisor Sum 915,633

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #1590037 ← → #1590047

Radix Representation

Decimal	1590039
Binary	110000100001100010111 (21 bits)
Octal	0o6041427
Hexadecimal	0x184317

Divisor Catalog (12)

1 3 9 11 33 99 16,061 48,183 144,549 176,671 530,013 1,590,039

Collatz Trajectory (101 steps to reach 1)

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

1,590,039 4,770,118 2,385,059 7,155,178 3,577,589 10,732,768 5,366,384 2,683,192 1,341,596 670,798 335,399 1,006,198 503,099 1,509,298 754,649 2,263,948 1,131,974 565,987 1,697,962 848,981 2,546,944 1,273,472 636,736 318,368 159,184 79,592 39,796 19,898 9,949 29,848 14,924 7,462 3,731 11,194 5,597 16,792 8,396 4,198 2,099 6,298 3,149 9,448 4,724 2,362 1,181 3,544 1,772 886 443 1,330 665 1,996 998 499 1,498 749 2,248 1,124 562 281

← Previous Integer #1,590,038 Browse Full Index Next Integer #1,590,040 →