14,435,688

2³ × 3 × 601487

14,435,688 factors as 2^3 × 3 × 601487. Its 16 positive divisors give a proper-divisor sum of 21,653,592, so this integer is abundant. The Collatz stopping time is 161 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 601487

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 36,089,280

Proper Divisor Sum 21,653,592

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #14435683 ← → #14435689

Radix Representation

Decimal	14435688
Binary	110111000100010101101000 (24 bits)
Octal	0o67042550
Hexadecimal	0xDC4568

Divisor Catalog (16)

1 2 3 4 6 8 12 24 601,487 1,202,974 1,804,461 2,405,948 3,608,922 4,811,896 7,217,844 14,435,688

Collatz Trajectory (161 steps to reach 1)

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

14,435,688 7,217,844 3,608,922 1,804,461 5,413,384 2,706,692 1,353,346 676,673 2,030,020 1,015,010 507,505 1,522,516 761,258 380,629 1,141,888 570,944 285,472 142,736 71,368 35,684 17,842 8,921 26,764 13,382 6,691 20,074 10,037 30,112 15,056 7,528 3,764 1,882 941 2,824 1,412 706 353 1,060 530 265 796 398 199 598 299 898 449 1,348 674 337 1,012 506 253 760 380 190 95 286 143 430

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #14,435,687 Browse Full Index Next Integer #14,435,689 →