Base | Representation |
---|---|
bin | 1000110011000101001… |
… | …1010011101000101111 |
3 | 112110010222021101012022 |
4 | 2030301103103220233 |
5 | 4434024124000421 |
6 | 153234322300355 |
7 | 13630443205466 |
oct | 2146123235057 |
9 | 473128241168 |
10 | 151151000111 |
11 | 59114887611 |
12 | 253641b76bb |
13 | 1133ab78807 |
14 | 745c5a79dd |
15 | 3de9b8b7ab |
hex | 23314d3a2f |
151151000111 has 2 divisors, whose sum is σ = 151151000112. Its totient is φ = 151151000110.
The previous prime is 151151000089. The next prime is 151151000123. The reversal of 151151000111 is 111000151151.
151151000111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-151151000111 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 151151000111.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (151151000131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75575500055 + 75575500056.
It is an arithmetic number, because the mean of its divisors is an integer number (75575500056).
Almost surely, 2151151000111 is an apocalyptic number.
151151000111 is a deficient number, since it is larger than the sum of its proper divisors (1).
151151000111 is an equidigital number, since it uses as much as digits as its factorization.
151151000111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 25, while the sum is 17.
Adding to 151151000111 its reverse (111000151151), we get a palindrome (262151151262).
The spelling of 151151000111 in words is "one hundred fifty-one billion, one hundred fifty-one million, one hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.162 sec. • engine limits •