11,684,154

2 × 3 × 1947359

11,684,154 factors as 2 × 3 × 1947359. Its 8 positive divisors give a proper-divisor sum of 11,684,166, so this integer is abundant. The Collatz stopping time is 65 steps.

Prime Factor Structure

Factorization String 2 × 3 × 1947359

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 23,368,320

Proper Divisor Sum 11,684,166

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #11684149 ← → #11684177

Radix Representation

Decimal	11684154
Binary	101100100100100100111010 (24 bits)
Octal	0o54444472
Hexadecimal	0xB2493A

Divisor Catalog (8)

1 2 3 6 1,947,359 3,894,718 5,842,077 11,684,154

Collatz Trajectory (65 steps to reach 1)

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

11,684,154 5,842,077 17,526,232 8,763,116 4,381,558 2,190,779 6,572,338 3,286,169 9,858,508 4,929,254 2,464,627 7,393,882 3,696,941 11,090,824 5,545,412 2,772,706 1,386,353 4,159,060 2,079,530 1,039,765 3,119,296 1,559,648 779,824 389,912 194,956 97,478 48,739 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,153 Browse Full Index Next Integer #11,684,155 →