1,062,778

2 × 641 × 829

1,062,778 factors as 2 × 641 × 829. Its 8 positive divisors give a proper-divisor sum of 535,802, so this integer is deficient. The Collatz stopping time is 103 steps.

Prime Factor Structure

Factorization String 2 × 641 × 829

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 1,598,580

Proper Divisor Sum 535,802

Digit Sum / Digital Root 31 (Root: 4)

Adjacent Primes #1062731 ← → #1062779

Radix Representation

Decimal	1062778
Binary	100000011011101111010 (21 bits)
Octal	0o4033572
Hexadecimal	0x10377A

Divisor Catalog (8)

1 2 641 829 1,282 1,658 531,389 1,062,778

Collatz Trajectory (103 steps to reach 1)

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

1,062,778 531,389 1,594,168 797,084 398,542 199,271 597,814 298,907 896,722 448,361 1,345,084 672,542 336,271 1,008,814 504,407 1,513,222 756,611 2,269,834 1,134,917 3,404,752 1,702,376 851,188 425,594 212,797 638,392 319,196 159,598 79,799 239,398 119,699 359,098 179,549 538,648 269,324 134,662 67,331 201,994 100,997 302,992 151,496 75,748 37,874 18,937 56,812 28,406 14,203 42,610 21,305 63,916 31,958 15,979 47,938 23,969 71,908 35,954 17,977 53,932 26,966 13,483 40,450

← Previous Integer #1,062,777 Browse Full Index Next Integer #1,062,779 →