6,940,734

2 × 3 × 821 × 1409

6,940,734 factors as 2 × 3 × 821 × 1409. Its 16 positive divisors give a proper-divisor sum of 6,967,506, so this integer is abundant. The Collatz stopping time is 134 steps.

Prime Factor Structure

Factorization String 2 × 3 × 821 × 1409

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 13,908,240

Proper Divisor Sum 6,967,506

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #6940729 ← → #6940741

Radix Representation

Decimal	6940734
Binary	11010011110100000111110 (23 bits)
Octal	0o32364076
Hexadecimal	0x69E83E

Divisor Catalog (16)

1 2 3 6 821 1,409 1,642 2,463 2,818 4,227 4,926 8,454 1,156,789 2,313,578 3,470,367 6,940,734

Collatz Trajectory (134 steps to reach 1)

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

6,940,734 3,470,367 10,411,102 5,205,551 15,616,654 7,808,327 23,424,982 11,712,491 35,137,474 17,568,737 52,706,212 26,353,106 13,176,553 39,529,660 19,764,830 9,882,415 29,647,246 14,823,623 44,470,870 22,235,435 66,706,306 33,353,153 100,059,460 50,029,730 25,014,865 75,044,596 37,522,298 18,761,149 56,283,448 28,141,724 14,070,862 7,035,431 21,106,294 10,553,147 31,659,442 15,829,721 47,489,164 23,744,582 11,872,291 35,616,874 17,808,437 53,425,312 26,712,656 13,356,328 6,678,164 3,339,082 1,669,541 5,008,624 2,504,312 1,252,156 626,078 313,039 939,118 469,559 1,408,678 704,339 2,113,018 1,056,509 3,169,528 1,584,764

← Previous Integer #6,940,733 Browse Full Index Next Integer #6,940,735 →