4,487,466

2 × 3 × 47 × 15913

4,487,466 factors as 2 × 3 × 47 × 15913. Its 16 positive divisors give a proper-divisor sum of 4,678,998, so this integer is abundant. The Collatz stopping time is 110 steps.

Prime Factor Structure

Factorization String 2 × 3 × 47 × 15913

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 9,166,464

Proper Divisor Sum 4,678,998

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #4487449 ← → #4487479

Radix Representation

Decimal	4487466
Binary	10001000111100100101010 (23 bits)
Octal	0o21074452
Hexadecimal	0x44792A

Divisor Catalog (16)

1 2 3 6 47 94 141 282 15,913 31,826 47,739 95,478 747,911 1,495,822 2,243,733 4,487,466

Collatz Trajectory (110 steps to reach 1)

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

4,487,466 2,243,733 6,731,200 3,365,600 1,682,800 841,400 420,700 210,350 105,175 315,526 157,763 473,290 236,645 709,936 354,968 177,484 88,742 44,371 133,114 66,557 199,672 99,836 49,918 24,959 74,878 37,439 112,318 56,159 168,478 84,239 252,718 126,359 379,078 189,539 568,618 284,309 852,928 426,464 213,232 106,616 53,308 26,654 13,327 39,982 19,991 59,974 29,987 89,962 44,981 134,944 67,472 33,736 16,868 8,434 4,217 12,652 6,326 3,163 9,490 4,745

← Previous Integer #4,487,465 Browse Full Index Next Integer #4,487,467 →