Base | Representation |
---|---|
bin | 101111100000110100… |
… | …010001110100100101 |
3 | 11212200102102201201110 |
4 | 233200310101310211 |
5 | 1313440202104000 |
6 | 35234151215233 |
7 | 3454143410646 |
oct | 574064216445 |
9 | 155612381643 |
10 | 51016441125 |
11 | 1a6aa4a6341 |
12 | 9a79377519 |
13 | 4a70515490 |
14 | 267d71b6cd |
15 | 14d8c22850 |
hex | be0d11d25 |
51016441125 has 128 divisors (see below), whose sum is σ = 100141816320. Its totient is φ = 22822195200.
The previous prime is 51016441123. The next prime is 51016441219. The reversal of 51016441125 is 52114461015.
It is not a de Polignac number, because 51016441125 - 21 = 51016441123 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 51016441092 and 51016441101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51016441123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 2392762 + ... + 2413988.
It is an arithmetic number, because the mean of its divisors is an integer number (782357940).
Almost surely, 251016441125 is an apocalyptic number.
It is an amenable number.
51016441125 is a deficient number, since it is larger than the sum of its proper divisors (49125375195).
51016441125 is a wasteful number, since it uses less digits than its factorization.
51016441125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21304 (or 21294 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 30.
The spelling of 51016441125 in words is "fifty-one billion, sixteen million, four hundred forty-one thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •