2,563,752

2³ × 3 × 106823

2,563,752 factors as 2^3 × 3 × 106823. Its 16 positive divisors give a proper-divisor sum of 3,845,688, so this integer is abundant. The Collatz stopping time is 73 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 106823

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 6,409,440

Proper Divisor Sum 3,845,688

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #2563751 ← → #2563763

Radix Representation

Decimal	2563752
Binary	1001110001111010101000 (22 bits)
Octal	0o11617250
Hexadecimal	0x271EA8

Divisor Catalog (16)

1 2 3 4 6 8 12 24 106,823 213,646 320,469 427,292 640,938 854,584 1,281,876 2,563,752

Collatz Trajectory (73 steps to reach 1)

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

2,563,752 1,281,876 640,938 320,469 961,408 480,704 240,352 120,176 60,088 30,044 15,022 7,511 22,534 11,267 33,802 16,901 50,704 25,352 12,676 6,338 3,169 9,508 4,754 2,377 7,132 3,566 1,783 5,350 2,675 8,026 4,013 12,040 6,020 3,010 1,505 4,516 2,258 1,129 3,388 1,694 847 2,542 1,271 3,814 1,907 5,722 2,861 8,584 4,292 2,146 1,073 3,220 1,610 805 2,416 1,208 604 302 151 454

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,563,751 Browse Full Index Next Integer #2,563,753 →