14,865,252

2² × 3 × 1238771

14,865,252 factors as 2^2 × 3 × 1238771. Its 12 positive divisors give a proper-divisor sum of 19,820,364, so this integer is abundant. The Collatz stopping time is 81 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 1238771

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 34,685,616

Proper Divisor Sum 19,820,364

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #14865241 ← → #14865271

Radix Representation

Decimal	14865252
Binary	111000101101001101100100 (24 bits)
Octal	0o70551544
Hexadecimal	0xE2D364

Divisor Catalog (12)

1 2 3 4 6 12 1,238,771 2,477,542 3,716,313 4,955,084 7,432,626 14,865,252

Collatz Trajectory (81 steps to reach 1)

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

14,865,252 7,432,626 3,716,313 11,148,940 5,574,470 2,787,235 8,361,706 4,180,853 12,542,560 6,271,280 3,135,640 1,567,820 783,910 391,955 1,175,866 587,933 1,763,800 881,900 440,950 220,475 661,426 330,713 992,140 496,070 248,035 744,106 372,053 1,116,160 558,080 279,040 139,520 69,760 34,880 17,440 8,720 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

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #14,865,251 Browse Full Index Next Integer #14,865,253 →