1,651,953

3 × 550651

1,651,953 factors as 3 × 550651. Its 4 positive divisors give a proper-divisor sum of 550,655, so this integer is deficient. The Collatz stopping time is 83 steps.

Prime Factor Structure

Factorization String 3 × 550651

Distinct Prime Factors 2

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 4

Divisor Sum (σ) 2,202,608

Proper Divisor Sum 550,655

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #1651943 ← → #1651961

Radix Representation

Decimal	1651953
Binary	110010011010011110001 (21 bits)
Octal	0o6232361
Hexadecimal	0x1934F1

Divisor Catalog (4)

1 3 550,651 1,651,953

Collatz Trajectory (83 steps to reach 1)

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

1,651,953 4,955,860 2,477,930 1,238,965 3,716,896 1,858,448 929,224 464,612 232,306 116,153 348,460 174,230 87,115 261,346 130,673 392,020 196,010 98,005 294,016 147,008 73,504 36,752 18,376 9,188 4,594 2,297 6,892 3,446 1,723 5,170 2,585 7,756 3,878 1,939 5,818 2,909 8,728 4,364 2,182 1,091 3,274 1,637 4,912 2,456 1,228 614 307 922 461 1,384 692 346 173 520 260 130 65 196 98 49

← Previous Integer #1,651,952 Browse Full Index Next Integer #1,651,954 →