Base | Representation |
---|---|
bin | 10010001000111… |
… | …01011010101101 |
3 | 101121022201210012 |
4 | 21010131122231 |
5 | 302423222023 |
6 | 23033223005 |
7 | 3525241601 |
oct | 1104353255 |
9 | 347281705 |
10 | 152164013 |
11 | 78990091 |
12 | 42b61a65 |
13 | 256a8ba1 |
14 | 162cd501 |
15 | d55a978 |
hex | 911d6ad |
152164013 has 2 divisors, whose sum is σ = 152164014. Its totient is φ = 152164012.
The previous prime is 152163961. The next prime is 152164043. The reversal of 152164013 is 310461251.
152164013 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 can be written as a sum of positive squares in only one way, i.e., 76090729 + 76073284 = 8723^2 + 8722^2 .
It is a cyclic number.
It is not a de Polignac number, because 152164013 - 214 = 152147629 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 152164013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (152164043) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 76082006 + 76082007.
It is an arithmetic number, because the mean of its divisors is an integer number (76082007).
Almost surely, 2152164013 is an apocalyptic number.
152164013 is the 8723-rd centered square number.
It is an amenable number.
152164013 is a deficient number, since it is larger than the sum of its proper divisors (1).
152164013 is an equidigital number, since it uses as much as digits as its factorization.
152164013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 720, while the sum is 23.
The square root of 152164013 is about 12335.4778180661. The cubic root of 152164013 is about 533.8722136216.
The spelling of 152164013 in words is "one hundred fifty-two million, one hundred sixty-four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •