4,863,546

2 × 3² × 157 × 1721

4,863,546 factors as 2 × 3^2 × 157 × 1721. Its 24 positive divisors give a proper-divisor sum of 5,747,418, so this integer is abundant. The Collatz stopping time is 69 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 157 × 1721

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 10,610,964

Proper Divisor Sum 5,747,418

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #4863493 ← → #4863553

Radix Representation

Decimal	4863546
Binary	10010100011011000111010 (23 bits)
Octal	0o22433072
Hexadecimal	0x4A363A

Divisor Catalog (24)

Collatz Trajectory (69 steps to reach 1)

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

4,863,546 2,431,773 7,295,320 3,647,660 1,823,830 911,915 2,735,746 1,367,873 4,103,620 2,051,810 1,025,905 3,077,716 1,538,858 769,429 2,308,288 1,154,144 577,072 288,536 144,268 72,134 36,067 108,202 54,101 162,304 81,152 40,576 20,288 10,144 5,072 2,536 1,268 634 317 952 476 238 119 358 179 538 269 808 404 202 101 304 152 76 38 19 58 29 88 44 22 11 34 17 52 26

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,863,545 Browse Full Index Next Integer #4,863,547 →