6,265,482

2 × 3 × 1044247

6,265,482 factors as 2 × 3 × 1044247. Its 8 positive divisors give a proper-divisor sum of 6,265,494, so this integer is abundant. The Collatz stopping time is 77 steps.

Prime Factor Structure

Factorization String 2 × 3 × 1044247

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 12,530,976

Proper Divisor Sum 6,265,494

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #6265481 ← → #6265489

Radix Representation

Decimal	6265482
Binary	10111111001101010001010 (23 bits)
Octal	0o27715212
Hexadecimal	0x5F9A8A

Divisor Catalog (8)

1 2 3 6 1,044,247 2,088,494 3,132,741 6,265,482

Collatz Trajectory (77 steps to reach 1)

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

6,265,482 3,132,741 9,398,224 4,699,112 2,349,556 1,174,778 587,389 1,762,168 881,084 440,542 220,271 660,814 330,407 991,222 495,611 1,486,834 743,417 2,230,252 1,115,126 557,563 1,672,690 836,345 2,509,036 1,254,518 627,259 1,881,778 940,889 2,822,668 1,411,334 705,667 2,117,002 1,058,501 3,175,504 1,587,752 793,876 396,938 198,469 595,408 297,704 148,852 74,426 37,213 111,640 55,820 27,910 13,955 41,866 20,933 62,800 31,400 15,700 7,850 3,925 11,776 5,888 2,944 1,472 736 368 184

← Previous Integer #6,265,481 Browse Full Index Next Integer #6,265,483 →