7,428,138

2 × 3 × 1238023

7,428,138 factors as 2 × 3 × 1238023. Its 8 positive divisors give a proper-divisor sum of 7,428,150, so this integer is abundant. The Collatz stopping time is 80 steps.

Prime Factor Structure

Factorization String 2 × 3 × 1238023

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 14,856,288

Proper Divisor Sum 7,428,150

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #7428119 ← → #7428151

Radix Representation

Decimal	7428138
Binary	11100010101100000101010 (23 bits)
Octal	0o34254052
Hexadecimal	0x71582A

Divisor Catalog (8)

1 2 3 6 1,238,023 2,476,046 3,714,069 7,428,138

Collatz Trajectory (80 steps to reach 1)

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

7,428,138 3,714,069 11,142,208 5,571,104 2,785,552 1,392,776 696,388 348,194 174,097 522,292 261,146 130,573 391,720 195,860 97,930 48,965 146,896 73,448 36,724 18,362 9,181 27,544 13,772 6,886 3,443 10,330 5,165 15,496 7,748 3,874 1,937 5,812 2,906 1,453 4,360 2,180 1,090 545 1,636 818 409 1,228 614 307 922 461 1,384 692 346 173 520 260 130 65 196 98 49 148 74 37

← Previous Integer #7,428,137 Browse Full Index Next Integer #7,428,139 →