6,940,698

2 × 3 × 1156783

6,940,698 factors as 2 × 3 × 1156783. Its 8 positive divisors give a proper-divisor sum of 6,940,710, so this integer is abundant. The Collatz stopping time is 191 steps.

Prime Factor Structure

Factorization String 2 × 3 × 1156783

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 13,881,408

Proper Divisor Sum 6,940,710

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #6940697 ← → #6940711

Radix Representation

Decimal	6940698
Binary	11010011110100000011010 (23 bits)
Octal	0o32364032
Hexadecimal	0x69E81A

Divisor Catalog (8)

1 2 3 6 1,156,783 2,313,566 3,470,349 6,940,698

Collatz Trajectory (191 steps to reach 1)

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

6,940,698 3,470,349 10,411,048 5,205,524 2,602,762 1,301,381 3,904,144 1,952,072 976,036 488,018 244,009 732,028 366,014 183,007 549,022 274,511 823,534 411,767 1,235,302 617,651 1,852,954 926,477 2,779,432 1,389,716 694,858 347,429 1,042,288 521,144 260,572 130,286 65,143 195,430 97,715 293,146 146,573 439,720 219,860 109,930 54,965 164,896 82,448 41,224 20,612 10,306 5,153 15,460 7,730 3,865 11,596 5,798 2,899 8,698 4,349 13,048 6,524 3,262 1,631 4,894 2,447 7,342

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #6,940,697 Browse Full Index Next Integer #6,940,699 →