7,158,114

2 × 3² × 397673

7,158,114 factors as 2 × 3^2 × 397673. Its 12 positive divisors give a proper-divisor sum of 8,351,172, so this integer is abundant. The Collatz stopping time is 98 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 397673

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 15,509,286

Proper Divisor Sum 8,351,172

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #7158097 ← → #7158119

Radix Representation

Decimal	7158114
Binary	11011010011100101100010 (23 bits)
Octal	0o33234542
Hexadecimal	0x6D3962

Divisor Catalog (12)

1 2 3 6 9 18 397,673 795,346 1,193,019 2,386,038 3,579,057 7,158,114

Collatz Trajectory (98 steps to reach 1)

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

7,158,114 3,579,057 10,737,172 5,368,586 2,684,293 8,052,880 4,026,440 2,013,220 1,006,610 503,305 1,509,916 754,958 377,479 1,132,438 566,219 1,698,658 849,329 2,547,988 1,273,994 636,997 1,910,992 955,496 477,748 238,874 119,437 358,312 179,156 89,578 44,789 134,368 67,184 33,592 16,796 8,398 4,199 12,598 6,299 18,898 9,449 28,348 14,174 7,087 21,262 10,631 31,894 15,947 47,842 23,921 71,764 35,882 17,941 53,824 26,912 13,456 6,728 3,364 1,682 841 2,524 1,262

← Previous Integer #7,158,113 Browse Full Index Next Integer #7,158,115 →