2,783,508

2² × 3 × 7 × 13 × 2549

2,783,508 factors as 2^2 × 3 × 7 × 13 × 2549. Its 48 positive divisors give a proper-divisor sum of 5,213,292, so this integer is abundant. The Collatz stopping time is 169 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 7 × 13 × 2549

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 7,996,800

Proper Divisor Sum 5,213,292

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #2783503 ← → #2783513

Radix Representation

Decimal	2783508
Binary	1010100111100100010100 (22 bits)
Octal	0o12474424
Hexadecimal	0x2A7914

Divisor Catalog (48)

1 2 3 4 6 7 12 13 14 21 26 28 39 42 52 78 84 91 156 182 273 364 546 1,092 2,549 5,098 7,647 10,196 15,294 17,843 30,588 33,137 35,686 53,529 66,274 71,372 99,411 107,058 132,548 198,822 214,116 231,959 397,644 463,918 695,877 927,836 1,391,754 2,783,508

Collatz Trajectory (169 steps to reach 1)

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

2,783,508 1,391,754 695,877 2,087,632 1,043,816 521,908 260,954 130,477 391,432 195,716 97,858 48,929 146,788 73,394 36,697 110,092 55,046 27,523 82,570 41,285 123,856 61,928 30,964 15,482 7,741 23,224 11,612 5,806 2,903 8,710 4,355 13,066 6,533 19,600 9,800 4,900 2,450 1,225 3,676 1,838 919 2,758 1,379 4,138 2,069 6,208 3,104 1,552 776 388 194 97 292 146 73 220 110 55 166 83

← Previous Integer #2,783,507 Browse Full Index Next Integer #2,783,509 →