Base | Representation |
---|---|
bin | 1000110011011101100… |
… | …0110100110111001011 |
3 | 112110102002102002221011 |
4 | 2030313120310313023 |
5 | 4434231244011334 |
6 | 153252411024351 |
7 | 13633123136551 |
oct | 2146730646713 |
9 | 473362362834 |
10 | 151253110219 |
11 | 5916748a432 |
12 | 2539243b0b7 |
13 | 1135607a8b3 |
14 | 746bd87bd1 |
15 | 3e03b0b564 |
hex | 2337634dcb |
151253110219 has 2 divisors, whose sum is σ = 151253110220. Its totient is φ = 151253110218.
The previous prime is 151253110159. The next prime is 151253110273. The reversal of 151253110219 is 912011352151.
It is a strong prime.
It is an emirp because it is prime and its reverse (912011352151) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-151253110219 is a prime.
It is a super-2 number, since 2×1512531102192 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (151253110279) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75626555109 + 75626555110.
It is an arithmetic number, because the mean of its divisors is an integer number (75626555110).
Almost surely, 2151253110219 is an apocalyptic number.
151253110219 is a deficient number, since it is larger than the sum of its proper divisors (1).
151253110219 is an equidigital number, since it uses as much as digits as its factorization.
151253110219 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2700, while the sum is 31.
The spelling of 151253110219 in words is "one hundred fifty-one billion, two hundred fifty-three million, one hundred ten thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •