4,486,386

2 × 3 × 747731

4,486,386 factors as 2 × 3 × 747731. Its 8 positive divisors give a proper-divisor sum of 4,486,398, so this integer is abundant. The Collatz stopping time is 136 steps.

Prime Factor Structure

Factorization String 2 × 3 × 747731

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 8,972,784

Proper Divisor Sum 4,486,398

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #4486381 ← → #4486411

Radix Representation

Decimal	4486386
Binary	10001000111010011110010 (23 bits)
Octal	0o21072362
Hexadecimal	0x4474F2

Divisor Catalog (8)

1 2 3 6 747,731 1,495,462 2,243,193 4,486,386

Collatz Trajectory (136 steps to reach 1)

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

4,486,386 2,243,193 6,729,580 3,364,790 1,682,395 5,047,186 2,523,593 7,570,780 3,785,390 1,892,695 5,678,086 2,839,043 8,517,130 4,258,565 12,775,696 6,387,848 3,193,924 1,596,962 798,481 2,395,444 1,197,722 598,861 1,796,584 898,292 449,146 224,573 673,720 336,860 168,430 84,215 252,646 126,323 378,970 189,485 568,456 284,228 142,114 71,057 213,172 106,586 53,293 159,880 79,940 39,970 19,985 59,956 29,978 14,989 44,968 22,484 11,242 5,621 16,864 8,432 4,216 2,108 1,054 527 1,582 791

← Previous Integer #4,486,385 Browse Full Index Next Integer #4,486,387 →