2,029,469

13 × 107 × 1459

2,029,469 factors as 13 × 107 × 1459. Its 8 positive divisors give a proper-divisor sum of 178,051, so this integer is deficient. The Collatz stopping time is 166 steps.

Prime Factor Structure

Factorization String 13 × 107 × 1459

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 2,207,520

Proper Divisor Sum 178,051

Digit Sum / Digital Root 32 (Root: 5)

Adjacent Primes #2029457 ← → #2029483

Radix Representation

Decimal	2029469
Binary	111101111011110011101 (21 bits)
Octal	0o7573635
Hexadecimal	0x1EF79D

Divisor Catalog (8)

1 13 107 1,391 1,459 18,967 156,113 2,029,469

Collatz Trajectory (166 steps to reach 1)

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

2,029,469 6,088,408 3,044,204 1,522,102 761,051 2,283,154 1,141,577 3,424,732 1,712,366 856,183 2,568,550 1,284,275 3,852,826 1,926,413 5,779,240 2,889,620 1,444,810 722,405 2,167,216 1,083,608 541,804 270,902 135,451 406,354 203,177 609,532 304,766 152,383 457,150 228,575 685,726 342,863 1,028,590 514,295 1,542,886 771,443 2,314,330 1,157,165 3,471,496 1,735,748 867,874 433,937 1,301,812 650,906 325,453 976,360 488,180 244,090 122,045 366,136 183,068 91,534 45,767 137,302 68,651 205,954 102,977 308,932 154,466 77,233

← Previous Integer #2,029,468 Browse Full Index Next Integer #2,029,470 →