Base | Representation |
---|---|
bin | 11100001101000000… |
… | …10000100000000111 |
3 | 1110002020102011002122 |
4 | 32012200100200013 |
5 | 222002211130111 |
6 | 10542251000155 |
7 | 1044135445352 |
oct | 160640204007 |
9 | 43066364078 |
10 | 15141505031 |
11 | 646aa91924 |
12 | 2b26a3905b |
13 | 1573c62443 |
14 | a38d3b299 |
15 | 5d9466cdb |
hex | 386810807 |
15141505031 has 2 divisors, whose sum is σ = 15141505032. Its totient is φ = 15141505030.
The previous prime is 15141505013. The next prime is 15141505063. The reversal of 15141505031 is 13050514151.
Together with previous prime (15141505013) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-15141505031 is a prime.
It is a super-4 number, since 4×151415050314 (a number of 42 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (15141505081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7570752515 + 7570752516.
It is an arithmetic number, because the mean of its divisors is an integer number (7570752516).
Almost surely, 215141505031 is an apocalyptic number.
15141505031 is a deficient number, since it is larger than the sum of its proper divisors (1).
15141505031 is an equidigital number, since it uses as much as digits as its factorization.
15141505031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1500, while the sum is 26.
The spelling of 15141505031 in words is "fifteen billion, one hundred forty-one million, five hundred five thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •