Base | Representation |
---|---|
bin | 1000110011000101001… |
… | …1010011100111110011 |
3 | 112110010222021101010002 |
4 | 2030301103103213303 |
5 | 4434024124000201 |
6 | 153234322300215 |
7 | 13630443205352 |
oct | 2146123234763 |
9 | 473128241102 |
10 | 151151000051 |
11 | 59114887567 |
12 | 253641b766b |
13 | 1133ab7878c |
14 | 745c5a7999 |
15 | 3de9b8b76b |
hex | 23314d39f3 |
151151000051 has 2 divisors, whose sum is σ = 151151000052. Its totient is φ = 151151000050.
The previous prime is 151151000023. The next prime is 151151000071. The reversal of 151151000051 is 150000151151.
It is an a-pointer prime, because the next prime (151151000071) can be obtained adding 151151000051 to its sum of digits (20).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 151151000051 - 226 = 151083891187 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 151150999987 and 151151000032.
It is not a weakly prime, because it can be changed into another prime (151151000071) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75575500025 + 75575500026.
It is an arithmetic number, because the mean of its divisors is an integer number (75575500026).
Almost surely, 2151151000051 is an apocalyptic number.
151151000051 is a deficient number, since it is larger than the sum of its proper divisors (1).
151151000051 is an equidigital number, since it uses as much as digits as its factorization.
151151000051 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 125, while the sum is 20.
The spelling of 151151000051 in words is "one hundred fifty-one billion, one hundred fifty-one million, fifty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •