Base | Representation |
---|---|
bin | 110000000110111100… |
… | …100101000000001011 |
3 | 11221100000011100202200 |
4 | 300012330211000023 |
5 | 1321242433313201 |
6 | 35421442331243 |
7 | 3506042016321 |
oct | 600674450013 |
9 | 157300140680 |
10 | 51656151051 |
11 | 1a9a860692a |
12 | a017659b23 |
13 | 4b42c0586b |
14 | 270067dd11 |
15 | 1524e86386 |
hex | c06f2500b |
51656151051 has 12 divisors (see below), whose sum is σ = 74616414912. Its totient is φ = 34436522736.
The previous prime is 51656151047. The next prime is 51656151083. The reversal of 51656151051 is 15015165615.
It is a happy number.
It is not a de Polignac number, because 51656151051 - 22 = 51656151047 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 51656150997 and 51656151015.
It is not an unprimeable number, because it can be changed into a prime (51656153051) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 595585 + ... + 676781.
It is an arithmetic number, because the mean of its divisors is an integer number (6218034576).
Almost surely, 251656151051 is an apocalyptic number.
51656151051 is a deficient number, since it is larger than the sum of its proper divisors (22960263861).
51656151051 is a wasteful number, since it uses less digits than its factorization.
51656151051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 151890 (or 151887 counting only the distinct ones).
The product of its (nonzero) digits is 22500, while the sum is 36.
The spelling of 51656151051 in words is "fifty-one billion, six hundred fifty-six million, one hundred fifty-one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •