7,973,562

2 × 3 × 1328927

7,973,562 factors as 2 × 3 × 1328927. Its 8 positive divisors give a proper-divisor sum of 7,973,574, so this integer is abundant. The Collatz stopping time is 217 steps.

Prime Factor Structure

Factorization String 2 × 3 × 1328927

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 15,947,136

Proper Divisor Sum 7,973,574

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #7973543 ← → #7973591

Radix Representation

Decimal	7973562
Binary	11110011010101010111010 (23 bits)
Octal	0o36325272
Hexadecimal	0x79AABA

Divisor Catalog (8)

1 2 3 6 1,328,927 2,657,854 3,986,781 7,973,562

Collatz Trajectory (217 steps to reach 1)

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

7,973,562 3,986,781 11,960,344 5,980,172 2,990,086 1,495,043 4,485,130 2,242,565 6,727,696 3,363,848 1,681,924 840,962 420,481 1,261,444 630,722 315,361 946,084 473,042 236,521 709,564 354,782 177,391 532,174 266,087 798,262 399,131 1,197,394 598,697 1,796,092 898,046 449,023 1,347,070 673,535 2,020,606 1,010,303 3,030,910 1,515,455 4,546,366 2,273,183 6,819,550 3,409,775 10,229,326 5,114,663 15,343,990 7,671,995 23,015,986 11,507,993 34,523,980 17,261,990 8,630,995 25,892,986 12,946,493 38,839,480 19,419,740 9,709,870 4,854,935 14,564,806 7,282,403 21,847,210 10,923,605

← Previous Integer #7,973,561 Browse Full Index Next Integer #7,973,563 →