Base | Representation |
---|---|
bin | 11100001010011101… |
… | …00110111011100101 |
3 | 1110000202010201102012 |
4 | 32011032212323211 |
5 | 221431221213333 |
6 | 10540204124005 |
7 | 1043455511246 |
oct | 160516467345 |
9 | 43022121365 |
10 | 15120101093 |
11 | 64599a2819 |
12 | 2b1b836605 |
13 | 156c6a9ca6 |
14 | a36168ccd |
15 | 5d7639e48 |
hex | 3853a6ee5 |
15120101093 has 2 divisors, whose sum is σ = 15120101094. Its totient is φ = 15120101092.
The previous prime is 15120101083. The next prime is 15120101111. The reversal of 15120101093 is 39010102151.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9510540484 + 5609560609 = 97522^2 + 74897^2 .
It is an emirp because it is prime and its reverse (39010102151) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 15120101093 - 230 = 14046359269 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (15120101033) 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, 7560050546 + 7560050547.
It is an arithmetic number, because the mean of its divisors is an integer number (7560050547).
Almost surely, 215120101093 is an apocalyptic number.
It is an amenable number.
15120101093 is a deficient number, since it is larger than the sum of its proper divisors (1).
15120101093 is an equidigital number, since it uses as much as digits as its factorization.
15120101093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 270, while the sum is 23.
The spelling of 15120101093 in words is "fifteen billion, one hundred twenty million, one hundred one thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •