4,898,568

2³ × 3 × 204107

4,898,568 factors as 2^3 × 3 × 204107. Its 16 positive divisors give a proper-divisor sum of 7,347,912, so this integer is abundant. The Collatz stopping time is 175 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 204107

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 12,246,480

Proper Divisor Sum 7,347,912

Digit Sum / Digital Root 48 (Root: 3)

Adjacent Primes #4898549 ← → #4898573

Radix Representation

Decimal	4898568
Binary	10010101011111100001000 (23 bits)
Octal	0o22537410
Hexadecimal	0x4ABF08

Divisor Catalog (16)

1 2 3 4 6 8 12 24 204,107 408,214 612,321 816,428 1,224,642 1,632,856 2,449,284 4,898,568

Collatz Trajectory (175 steps to reach 1)

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

4,898,568 2,449,284 1,224,642 612,321 1,836,964 918,482 459,241 1,377,724 688,862 344,431 1,033,294 516,647 1,549,942 774,971 2,324,914 1,162,457 3,487,372 1,743,686 871,843 2,615,530 1,307,765 3,923,296 1,961,648 980,824 490,412 245,206 122,603 367,810 183,905 551,716 275,858 137,929 413,788 206,894 103,447 310,342 155,171 465,514 232,757 698,272 349,136 174,568 87,284 43,642 21,821 65,464 32,732 16,366 8,183 24,550 12,275 36,826 18,413 55,240 27,620 13,810 6,905 20,716 10,358 5,179

← Previous Integer #4,898,567 Browse Full Index Next Integer #4,898,569 →