5,230,488

2³ × 3 × 217937

5,230,488 factors as 2^3 × 3 × 217937. Its 16 positive divisors give a proper-divisor sum of 7,845,792, so this integer is abundant. The Collatz stopping time is 157 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 217937

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 13,076,280

Proper Divisor Sum 7,845,792

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #5230471 ← → #5230513

Radix Representation

Decimal	5230488
Binary	10011111100111110011000 (23 bits)
Octal	0o23747630
Hexadecimal	0x4FCF98

Divisor Catalog (16)

1 2 3 4 6 8 12 24 217,937 435,874 653,811 871,748 1,307,622 1,743,496 2,615,244 5,230,488

Collatz Trajectory (157 steps to reach 1)

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

5,230,488 2,615,244 1,307,622 653,811 1,961,434 980,717 2,942,152 1,471,076 735,538 367,769 1,103,308 551,654 275,827 827,482 413,741 1,241,224 620,612 310,306 155,153 465,460 232,730 116,365 349,096 174,548 87,274 43,637 130,912 65,456 32,728 16,364 8,182 4,091 12,274 6,137 18,412 9,206 4,603 13,810 6,905 20,716 10,358 5,179 15,538 7,769 23,308 11,654 5,827 17,482 8,741 26,224 13,112 6,556 3,278 1,639 4,918 2,459 7,378 3,689 11,068 5,534

← Previous Integer #5,230,487 Browse Full Index Next Integer #5,230,489 →