36,909,186

2 × 3 × 6151531

36,909,186 factors as 2 × 3 × 6151531. Its 8 positive divisors give a proper-divisor sum of 36,909,198, so this integer is abundant. The Collatz stopping time is 77 steps.

Prime Factor Structure

Factorization String 2 × 3 × 6151531

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 73,818,384

Proper Divisor Sum 36,909,198

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #36909163 ← → #36909211

Radix Representation

Decimal	36909186
Binary	10001100110011000010000010 (26 bits)
Octal	0o214630202
Hexadecimal	0x2333082

Divisor Catalog (8)

1 2 3 6 6,151,531 12,303,062 18,454,593 36,909,186

Collatz Trajectory (77 steps to reach 1)

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

36,909,186 18,454,593 55,363,780 27,681,890 13,840,945 41,522,836 20,761,418 10,380,709 31,142,128 15,571,064 7,785,532 3,892,766 1,946,383 5,839,150 2,919,575 8,758,726 4,379,363 13,138,090 6,569,045 19,707,136 9,853,568 4,926,784 2,463,392 1,231,696 615,848 307,924 153,962 76,981 230,944 115,472 57,736 28,868 14,434 7,217 21,652 10,826 5,413 16,240 8,120 4,060 2,030 1,015 3,046 1,523 4,570 2,285 6,856 3,428 1,714 857 2,572 1,286 643 1,930 965 2,896 1,448 724 362 181

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #36,909,185 Browse Full Index Next Integer #36,909,187 →