51,186,270

2 × 3 × 5 × 23 × 31 × 2393

51,186,270 factors as 2 × 3 × 5 × 23 × 31 × 2393. Its 64 positive divisors give a proper-divisor sum of 81,192,354, so this integer is abundant. The Collatz stopping time is 230 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5 × 23 × 31 × 2393

Distinct Prime Factors 6

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 64

Divisor Sum (σ) 132,378,624

Proper Divisor Sum 81,192,354

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #51186263 ← → #51186277

Radix Representation

Decimal	51186270
Binary	11000011010000101001011110 (26 bits)
Octal	0o303205136
Hexadecimal	0x30D0A5E

Divisor Catalog (60 of 64)

1 2 3 5 6 10 15 23 30 31 46 62 69 93 115 138 155 186 230 310 345 465 690 713 930 1,426 2,139 2,393 3,565 4,278 4,786 7,130 7,179 10,695 11,965 14,358 21,390 23,930 35,895 55,039 71,790 74,183 110,078 148,366 165,117 222,549 275,195 330,234 370,915 445,098 550,390 741,830 825,585 1,112,745 1,651,170 1,706,209 2,225,490 3,412,418 5,118,627 8,531,045

Collatz Trajectory (230 steps to reach 1)

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

51,186,270 25,593,135 76,779,406 38,389,703 115,169,110 57,584,555 172,753,666 86,376,833 259,130,500 129,565,250 64,782,625 194,347,876 97,173,938 48,586,969 145,760,908 72,880,454 36,440,227 109,320,682 54,660,341 163,981,024 81,990,512 40,995,256 20,497,628 10,248,814 5,124,407 15,373,222 7,686,611 23,059,834 11,529,917 34,589,752 17,294,876 8,647,438 4,323,719 12,971,158 6,485,579 19,456,738 9,728,369 29,185,108 14,592,554 7,296,277 21,888,832 10,944,416 5,472,208 2,736,104 1,368,052 684,026 342,013 1,026,040 513,020 256,510 128,255 384,766 192,383 577,150 288,575 865,726 432,863 1,298,590 649,295 1,947,886

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #51,186,269 Browse Full Index Next Integer #51,186,271 →