14,616,138

2 × 3 × 2436023

14,616,138 factors as 2 × 3 × 2436023. Its 8 positive divisors give a proper-divisor sum of 14,616,150, so this integer is abundant. The Collatz stopping time is 68 steps.

Prime Factor Structure

Factorization String 2 × 3 × 2436023

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 29,232,288

Proper Divisor Sum 14,616,150

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #14616079 ← → #14616139

Radix Representation

Decimal	14616138
Binary	110111110000011001001010 (24 bits)
Octal	0o67603112
Hexadecimal	0xDF064A

Divisor Catalog (8)

1 2 3 6 2,436,023 4,872,046 7,308,069 14,616,138

Collatz Trajectory (68 steps to reach 1)

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

14,616,138 7,308,069 21,924,208 10,962,104 5,481,052 2,740,526 1,370,263 4,110,790 2,055,395 6,166,186 3,083,093 9,249,280 4,624,640 2,312,320 1,156,160 578,080 289,040 144,520 72,260 36,130 18,065 54,196 27,098 13,549 40,648 20,324 10,162 5,081 15,244 7,622 3,811 11,434 5,717 17,152 8,576 4,288 2,144 1,072 536 268 134 67 202 101 304 152 76 38 19 58 29 88 44 22 11 34 17 52 26 13

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #14,616,137 Browse Full Index Next Integer #14,616,139 →