4,768,284

2² × 3 × 397357

4,768,284 factors as 2^2 × 3 × 397357. Its 12 positive divisors give a proper-divisor sum of 6,357,740, so this integer is abundant. The Collatz stopping time is 100 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 397357

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 11,126,024

Proper Divisor Sum 6,357,740

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #4768273 ← → #4768307

Radix Representation

Decimal	4768284
Binary	10010001100001000011100 (23 bits)
Octal	0o22141034
Hexadecimal	0x48C21C

Divisor Catalog (12)

1 2 3 4 6 12 397,357 794,714 1,192,071 1,589,428 2,384,142 4,768,284

Collatz Trajectory (100 steps to reach 1)

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

4,768,284 2,384,142 1,192,071 3,576,214 1,788,107 5,364,322 2,682,161 8,046,484 4,023,242 2,011,621 6,034,864 3,017,432 1,508,716 754,358 377,179 1,131,538 565,769 1,697,308 848,654 424,327 1,272,982 636,491 1,909,474 954,737 2,864,212 1,432,106 716,053 2,148,160 1,074,080 537,040 268,520 134,260 67,130 33,565 100,696 50,348 25,174 12,587 37,762 18,881 56,644 28,322 14,161 42,484 21,242 10,621 31,864 15,932 7,966 3,983 11,950 5,975 17,926 8,963 26,890 13,445 40,336 20,168 10,084 5,042

← Previous Integer #4,768,283 Browse Full Index Next Integer #4,768,285 →