6,850,860

2² × 3 × 5 × 227 × 503

6,850,860 factors as 2^2 × 3 × 5 × 227 × 503. Its 48 positive divisors give a proper-divisor sum of 12,454,356, so this integer is abundant. The Collatz stopping time is 129 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 5 × 227 × 503

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 19,305,216

Proper Divisor Sum 12,454,356

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #6850853 ← → #6850897

Radix Representation

Decimal	6850860
Binary	11010001000100100101100 (23 bits)
Octal	0o32104454
Hexadecimal	0x68892C

Divisor Catalog (48)

1 2 3 4 5 6 10 12 15 20 30 60 227 454 503 681 908 1,006 1,135 1,362 1,509 2,012 2,270 2,515 2,724 3,018 3,405 4,540 5,030 6,036 6,810 7,545 10,060 13,620 15,090 30,180 114,181 228,362 342,543 456,724 570,905 685,086 1,141,810 1,370,172 1,712,715 2,283,620 3,425,430 6,850,860

Collatz Trajectory (129 steps to reach 1)

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

6,850,860 3,425,430 1,712,715 5,138,146 2,569,073 7,707,220 3,853,610 1,926,805 5,780,416 2,890,208 1,445,104 722,552 361,276 180,638 90,319 270,958 135,479 406,438 203,219 609,658 304,829 914,488 457,244 228,622 114,311 342,934 171,467 514,402 257,201 771,604 385,802 192,901 578,704 289,352 144,676 72,338 36,169 108,508 54,254 27,127 81,382 40,691 122,074 61,037 183,112 91,556 45,778 22,889 68,668 34,334 17,167 51,502 25,751 77,254 38,627 115,882 57,941 173,824 86,912 43,456

← Previous Integer #6,850,859 Browse Full Index Next Integer #6,850,861 →