2,496,768

2⁸ × 3 × 3251

2,496,768 factors as 2^8 × 3 × 3251. Its 36 positive divisors give a proper-divisor sum of 4,150,320, so this integer is abundant. The Collatz stopping time is 130 steps.

Prime Factor Structure

Factorization String 2^8 × 3 × 3251

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 36

Divisor Sum (σ) 6,647,088

Proper Divisor Sum 4,150,320

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #2496757 ← → #2496779

Radix Representation

Decimal	2496768
Binary	1001100001100100000000 (22 bits)
Octal	0o11414400
Hexadecimal	0x261900

Divisor Catalog (36)

1 2 3 4 6 8 12 16 24 32 48 64 96 128 192 256 384 768 3,251 6,502 9,753 13,004 19,506 26,008 39,012 52,016 78,024 104,032 156,048 208,064 312,096 416,128 624,192 832,256 1,248,384 2,496,768

Collatz Trajectory (130 steps to reach 1)

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

2,496,768 1,248,384 624,192 312,096 156,048 78,024 39,012 19,506 9,753 29,260 14,630 7,315 21,946 10,973 32,920 16,460 8,230 4,115 12,346 6,173 18,520 9,260 4,630 2,315 6,946 3,473 10,420 5,210 2,605 7,816 3,908 1,954 977 2,932 1,466 733 2,200 1,100 550 275 826 413 1,240 620 310 155 466 233 700 350 175 526 263 790 395 1,186 593 1,780 890 445

← Previous Integer #2,496,767 Browse Full Index Next Integer #2,496,769 →