1,025,105

5 × 61 × 3361

1,025,105 factors as 5 × 61 × 3361. Its 8 positive divisors give a proper-divisor sum of 225,559, so this integer is deficient. The Collatz stopping time is 183 steps.

Prime Factor Structure

Factorization String 5 × 61 × 3361

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 1,250,664

Proper Divisor Sum 225,559

Digit Sum / Digital Root 14 (Root: 5)

Adjacent Primes #1025099 ← → #1025111

Radix Representation

Decimal	1025105
Binary	11111010010001010001 (20 bits)
Octal	0o3722121
Hexadecimal	0xFA451

Divisor Catalog (8)

1 5 61 305 3,361 16,805 205,021 1,025,105

Collatz Trajectory (183 steps to reach 1)

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

1,025,105 3,075,316 1,537,658 768,829 2,306,488 1,153,244 576,622 288,311 864,934 432,467 1,297,402 648,701 1,946,104 973,052 486,526 243,263 729,790 364,895 1,094,686 547,343 1,642,030 821,015 2,463,046 1,231,523 3,694,570 1,847,285 5,541,856 2,770,928 1,385,464 692,732 346,366 173,183 519,550 259,775 779,326 389,663 1,168,990 584,495 1,753,486 876,743 2,630,230 1,315,115 3,945,346 1,972,673 5,918,020 2,959,010 1,479,505 4,438,516 2,219,258 1,109,629 3,328,888 1,664,444 832,222 416,111 1,248,334 624,167 1,872,502 936,251 2,808,754 1,404,377

← Previous Integer #1,025,104 Browse Full Index Next Integer #1,025,106 →