6,157,188

2² × 3³ × 47 × 1213

6,157,188 factors as 2^2 × 3^3 × 47 × 1213. Its 48 positive divisors give a proper-divisor sum of 10,158,972, so this integer is abundant. The Collatz stopping time is 196 steps.

Prime Factor Structure

Factorization String 2^2 × 3^3 × 47 × 1213

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 16,316,160

Proper Divisor Sum 10,158,972

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #6157187 ← → #6157199

Radix Representation

Decimal	6157188
Binary	10111011111001110000100 (23 bits)
Octal	0o27371604
Hexadecimal	0x5DF384

Divisor Catalog (48)

1 2 3 4 6 9 12 18 27 36 47 54 94 108 141 188 282 423 564 846 1,213 1,269 1,692 2,426 2,538 3,639 4,852 5,076 7,278 10,917 14,556 21,834 32,751 43,668 57,011 65,502 114,022 131,004 171,033 228,044 342,066 513,099 684,132 1,026,198 1,539,297 2,052,396 3,078,594 6,157,188

Collatz Trajectory (196 steps to reach 1)

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

6,157,188 3,078,594 1,539,297 4,617,892 2,308,946 1,154,473 3,463,420 1,731,710 865,855 2,597,566 1,298,783 3,896,350 1,948,175 5,844,526 2,922,263 8,766,790 4,383,395 13,150,186 6,575,093 19,725,280 9,862,640 4,931,320 2,465,660 1,232,830 616,415 1,849,246 924,623 2,773,870 1,386,935 4,160,806 2,080,403 6,241,210 3,120,605 9,361,816 4,680,908 2,340,454 1,170,227 3,510,682 1,755,341 5,266,024 2,633,012 1,316,506 658,253 1,974,760 987,380 493,690 246,845 740,536 370,268 185,134 92,567 277,702 138,851 416,554 208,277 624,832 312,416 156,208 78,104 39,052

← Previous Integer #6,157,187 Browse Full Index Next Integer #6,157,189 →