7,080,102

2 × 3³ × 131113

7,080,102 factors as 2 × 3^3 × 131113. Its 16 positive divisors give a proper-divisor sum of 8,653,578, so this integer is abundant. The Collatz stopping time is 222 steps.

Prime Factor Structure

Factorization String 2 × 3^3 × 131113

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 15,733,680

Proper Divisor Sum 8,653,578

Digit Sum / Digital Root 18 (Root: 9)

Adjacent Primes #7080097 ← → #7080107

Radix Representation

Decimal	7080102
Binary	11011000000100010100110 (23 bits)
Octal	0o33004246
Hexadecimal	0x6C08A6

Divisor Catalog (16)

1 2 3 6 9 18 27 54 131,113 262,226 393,339 786,678 1,180,017 2,360,034 3,540,051 7,080,102

Collatz Trajectory (222 steps to reach 1)

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

7,080,102 3,540,051 10,620,154 5,310,077 15,930,232 7,965,116 3,982,558 1,991,279 5,973,838 2,986,919 8,960,758 4,480,379 13,441,138 6,720,569 20,161,708 10,080,854 5,040,427 15,121,282 7,560,641 22,681,924 11,340,962 5,670,481 17,011,444 8,505,722 4,252,861 12,758,584 6,379,292 3,189,646 1,594,823 4,784,470 2,392,235 7,176,706 3,588,353 10,765,060 5,382,530 2,691,265 8,073,796 4,036,898 2,018,449 6,055,348 3,027,674 1,513,837 4,541,512 2,270,756 1,135,378 567,689 1,703,068 851,534 425,767 1,277,302 638,651 1,915,954 957,977 2,873,932 1,436,966 718,483 2,155,450 1,077,725 3,233,176 1,616,588

← Previous Integer #7,080,101 Browse Full Index Next Integer #7,080,103 →