2,755,938

2 × 3 × 17 × 41 × 659

2,755,938 factors as 2 × 3 × 17 × 41 × 659. Its 32 positive divisors give a proper-divisor sum of 3,231,582, so this integer is abundant. The Collatz stopping time is 107 steps.

Prime Factor Structure

Factorization String 2 × 3 × 17 × 41 × 659

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 5,987,520

Proper Divisor Sum 3,231,582

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #2755891 ← → #2755943

Radix Representation

Decimal	2755938
Binary	1010100000110101100010 (22 bits)
Octal	0o12406542
Hexadecimal	0x2A0D62

Divisor Catalog (32)

1 2 3 6 17 34 41 51 82 102 123 246 659 697 1,318 1,394 1,977 2,091 3,954 4,182 11,203 22,406 27,019 33,609 54,038 67,218 81,057 162,114 459,323 918,646 1,377,969 2,755,938

Collatz Trajectory (107 steps to reach 1)

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

2,755,938 1,377,969 4,133,908 2,066,954 1,033,477 3,100,432 1,550,216 775,108 387,554 193,777 581,332 290,666 145,333 436,000 218,000 109,000 54,500 27,250 13,625 40,876 20,438 10,219 30,658 15,329 45,988 22,994 11,497 34,492 17,246 8,623 25,870 12,935 38,806 19,403 58,210 29,105 87,316 43,658 21,829 65,488 32,744 16,372 8,186 4,093 12,280 6,140 3,070 1,535 4,606 2,303 6,910 3,455 10,366 5,183 15,550 7,775 23,326 11,663 34,990 17,495

← Previous Integer #2,755,937 Browse Full Index Next Integer #2,755,939 →