11,684,136

2³ × 3 × 486839

11,684,136 factors as 2^3 × 3 × 486839. Its 16 positive divisors give a proper-divisor sum of 17,526,264, so this integer is abundant. The Collatz stopping time is 65 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 486839

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 29,210,400

Proper Divisor Sum 17,526,264

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #11684111 ← → #11684149

Radix Representation

Decimal	11684136
Binary	101100100100100100101000 (24 bits)
Octal	0o54444450
Hexadecimal	0xB24928

Divisor Catalog (16)

1 2 3 4 6 8 12 24 486,839 973,678 1,460,517 1,947,356 2,921,034 3,894,712 5,842,068 11,684,136

Collatz Trajectory (65 steps to reach 1)

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

11,684,136 5,842,068 2,921,034 1,460,517 4,381,552 2,190,776 1,095,388 547,694 273,847 821,542 410,771 1,232,314 616,157 1,848,472 924,236 462,118 231,059 693,178 346,589 1,039,768 519,884 259,942 129,971 389,914 194,957 584,872 292,436 146,218 73,109 219,328 109,664 54,832 27,416 13,708 6,854 3,427 10,282 5,141 15,424 7,712 3,856 1,928 964 482 241 724 362 181 544 272 136 68 34 17 52 26 13 40 20 10

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #11,684,135 Browse Full Index Next Integer #11,684,137 →