12,014,658

2 × 3² × 503 × 1327

12,014,658 factors as 2 × 3^2 × 503 × 1327. Its 24 positive divisors give a proper-divisor sum of 14,088,510, so this integer is abundant. The Collatz stopping time is 114 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 503 × 1327

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 26,103,168

Proper Divisor Sum 14,088,510

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #12014633 ← → #12014663

Radix Representation

Decimal	12014658
Binary	101101110101010001000010 (24 bits)
Octal	0o55652102
Hexadecimal	0xB75442

Divisor Catalog (24)

Collatz Trajectory (114 steps to reach 1)

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

12,014,658 6,007,329 18,021,988 9,010,994 4,505,497 13,516,492 6,758,246 3,379,123 10,137,370 5,068,685 15,206,056 7,603,028 3,801,514 1,900,757 5,702,272 2,851,136 1,425,568 712,784 356,392 178,196 89,098 44,549 133,648 66,824 33,412 16,706 8,353 25,060 12,530 6,265 18,796 9,398 4,699 14,098 7,049 21,148 10,574 5,287 15,862 7,931 23,794 11,897 35,692 17,846 8,923 26,770 13,385 40,156 20,078 10,039 30,118 15,059 45,178 22,589 67,768 33,884 16,942 8,471 25,414 12,707

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #12,014,657 Browse Full Index Next Integer #12,014,659 →