Base | Representation |
---|---|
bin | 101111100111101101… |
… | …101011000101011001 |
3 | 11212222111011100121020 |
4 | 233213231223011121 |
5 | 1314204312300410 |
6 | 35253443233053 |
7 | 3460050050631 |
oct | 574755530531 |
9 | 155874140536 |
10 | 51132150105 |
11 | 1a7598471a3 |
12 | 9ab0078789 |
13 | 4a8b49922a |
14 | 2690c3b6c1 |
15 | 14e3e7ba70 |
hex | be7b6b159 |
51132150105 has 48 divisors (see below), whose sum is σ = 86966389440. Its totient is φ = 25648949376.
The previous prime is 51132150077. The next prime is 51132150131. The reversal of 51132150105 is 50105123115.
It is not a de Polignac number, because 51132150105 - 27 = 51132149977 is a prime.
It is a super-2 number, since 2×511321501052 (a number of 22 digits) contains 22 as substring.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 718719 + ... + 786651.
It is an arithmetic number, because the mean of its divisors is an integer number (1811799780).
Almost surely, 251132150105 is an apocalyptic number.
It is an amenable number.
51132150105 is a deficient number, since it is larger than the sum of its proper divisors (35834239335).
51132150105 is a wasteful number, since it uses less digits than its factorization.
51132150105 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 68118 (or 68099 counting only the distinct ones).
The product of its (nonzero) digits is 750, while the sum is 24.
The spelling of 51132150105 in words is "fifty-one billion, one hundred thirty-two million, one hundred fifty thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •