6,972,402

2 × 3 × 1162067

6,972,402 factors as 2 × 3 × 1162067. Its 8 positive divisors give a proper-divisor sum of 6,972,414, so this integer is abundant. The Collatz stopping time is 147 steps.

Prime Factor Structure

Factorization String 2 × 3 × 1162067

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 13,944,816

Proper Divisor Sum 6,972,414

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #6972401 ← → #6972451

Radix Representation

Decimal	6972402
Binary	11010100110001111110010 (23 bits)
Octal	0o32461762
Hexadecimal	0x6A63F2

Divisor Catalog (8)

1 2 3 6 1,162,067 2,324,134 3,486,201 6,972,402

Collatz Trajectory (147 steps to reach 1)

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

6,972,402 3,486,201 10,458,604 5,229,302 2,614,651 7,843,954 3,921,977 11,765,932 5,882,966 2,941,483 8,824,450 4,412,225 13,236,676 6,618,338 3,309,169 9,927,508 4,963,754 2,481,877 7,445,632 3,722,816 1,861,408 930,704 465,352 232,676 116,338 58,169 174,508 87,254 43,627 130,882 65,441 196,324 98,162 49,081 147,244 73,622 36,811 110,434 55,217 165,652 82,826 41,413 124,240 62,120 31,060 15,530 7,765 23,296 11,648 5,824 2,912 1,456 728 364 182 91 274 137 412 206

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #6,972,401 Browse Full Index Next Integer #6,972,403 →