6,973,338

2 × 3 × 1162223

6,973,338 factors as 2 × 3 × 1162223. Its 8 positive divisors give a proper-divisor sum of 6,973,350, so this integer is abundant. The Collatz stopping time is 98 steps.

Prime Factor Structure

Factorization String 2 × 3 × 1162223

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 13,946,688

Proper Divisor Sum 6,973,350

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #6973333 ← → #6973381

Radix Representation

Decimal	6973338
Binary	11010100110011110011010 (23 bits)
Octal	0o32463632
Hexadecimal	0x6A679A

Divisor Catalog (8)

1 2 3 6 1,162,223 2,324,446 3,486,669 6,973,338

Collatz Trajectory (98 steps to reach 1)

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

6,973,338 3,486,669 10,460,008 5,230,004 2,615,002 1,307,501 3,922,504 1,961,252 980,626 490,313 1,470,940 735,470 367,735 1,103,206 551,603 1,654,810 827,405 2,482,216 1,241,108 620,554 310,277 930,832 465,416 232,708 116,354 58,177 174,532 87,266 43,633 130,900 65,450 32,725 98,176 49,088 24,544 12,272 6,136 3,068 1,534 767 2,302 1,151 3,454 1,727 5,182 2,591 7,774 3,887 11,662 5,831 17,494 8,747 26,242 13,121 39,364 19,682 9,841 29,524 14,762 7,381

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #6,973,337 Browse Full Index Next Integer #6,973,339 →