Base | Representation |
---|---|
bin | 11100001111101110… |
… | …00000100010001111 |
3 | 1110010211012112001122 |
4 | 32013313000202033 |
5 | 222024021334114 |
6 | 10544422231155 |
7 | 1044532652126 |
oct | 160767004217 |
9 | 43124175048 |
10 | 15164246159 |
11 | 6481904647 |
12 | 2b325854bb |
13 | 157889542a |
14 | a3bd7aabd |
15 | 5db459e8e |
hex | 387dc088f |
15164246159 has 2 divisors, whose sum is σ = 15164246160. Its totient is φ = 15164246158.
The previous prime is 15164246117. The next prime is 15164246191. The reversal of 15164246159 is 95164246151.
15164246159 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-15164246159 is a prime.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (15164246059) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7582123079 + 7582123080.
It is an arithmetic number, because the mean of its divisors is an integer number (7582123080).
Almost surely, 215164246159 is an apocalyptic number.
15164246159 is a deficient number, since it is larger than the sum of its proper divisors (1).
15164246159 is an equidigital number, since it uses as much as digits as its factorization.
15164246159 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 259200, while the sum is 44.
The spelling of 15164246159 in words is "fifteen billion, one hundred sixty-four million, two hundred forty-six thousand, one hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •