6,781,794

2 × 3 × 1130299

6,781,794 factors as 2 × 3 × 1130299. Its 8 positive divisors give a proper-divisor sum of 6,781,806, so this integer is abundant. The Collatz stopping time is 178 steps.

Prime Factor Structure

Factorization String 2 × 3 × 1130299

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 13,563,600

Proper Divisor Sum 6,781,806

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #6781763 ← → #6781799

Radix Representation

Decimal	6781794
Binary	11001110111101101100010 (23 bits)
Octal	0o31675542
Hexadecimal	0x677B62

Divisor Catalog (8)

1 2 3 6 1,130,299 2,260,598 3,390,897 6,781,794

Collatz Trajectory (178 steps to reach 1)

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

6,781,794 3,390,897 10,172,692 5,086,346 2,543,173 7,629,520 3,814,760 1,907,380 953,690 476,845 1,430,536 715,268 357,634 178,817 536,452 268,226 134,113 402,340 201,170 100,585 301,756 150,878 75,439 226,318 113,159 339,478 169,739 509,218 254,609 763,828 381,914 190,957 572,872 286,436 143,218 71,609 214,828 107,414 53,707 161,122 80,561 241,684 120,842 60,421 181,264 90,632 45,316 22,658 11,329 33,988 16,994 8,497 25,492 12,746 6,373 19,120 9,560 4,780 2,390 1,195

← Previous Integer #6,781,793 Browse Full Index Next Integer #6,781,795 →