2,512,468

2² × 7 × 61 × 1471

2,512,468 factors as 2^2 × 7 × 61 × 1471. Its 24 positive divisors give a proper-divisor sum of 2,598,316, so this integer is abundant. The Collatz stopping time is 174 steps.

Prime Factor Structure

Factorization String 2^2 × 7 × 61 × 1471

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 5,110,784

Proper Divisor Sum 2,598,316

Digit Sum / Digital Root 28 (Root: 1)

Adjacent Primes #2512463 ← → #2512469

Radix Representation

Decimal	2512468
Binary	1001100101011001010100 (22 bits)
Octal	0o11453124
Hexadecimal	0x265654

Divisor Catalog (24)

1 2 4 7 14 28 61 122 244 427 854 1,471 1,708 2,942 5,884 10,297 20,594 41,188 89,731 179,462 358,924 628,117 1,256,234 2,512,468

Collatz Trajectory (174 steps to reach 1)

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

2,512,468 1,256,234 628,117 1,884,352 942,176 471,088 235,544 117,772 58,886 29,443 88,330 44,165 132,496 66,248 33,124 16,562 8,281 24,844 12,422 6,211 18,634 9,317 27,952 13,976 6,988 3,494 1,747 5,242 2,621 7,864 3,932 1,966 983 2,950 1,475 4,426 2,213 6,640 3,320 1,660 830 415 1,246 623 1,870 935 2,806 1,403 4,210 2,105 6,316 3,158 1,579 4,738 2,369 7,108 3,554 1,777 5,332 2,666

← Previous Integer #2,512,467 Browse Full Index Next Integer #2,512,469 →