Base | Representation |
---|---|
bin | 11000011010000000… |
… | …00011100000111101 |
3 | 1020211011122101110111 |
4 | 30031000003200331 |
5 | 203313333120333 |
6 | 10004111110021 |
7 | 642463555522 |
oct | 141500034075 |
9 | 36734571414 |
10 | 13103020093 |
11 | 5614349a29 |
12 | 2658212311 |
13 | 130a832037 |
14 | 8c4305149 |
15 | 51a5014cd |
hex | 30d00383d |
13103020093 has 2 divisors, whose sum is σ = 13103020094. Its totient is φ = 13103020092.
The previous prime is 13103020081. The next prime is 13103020127. The reversal of 13103020093 is 39002030131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13095826969 + 7193124 = 114437^2 + 2682^2 .
It is an emirp because it is prime and its reverse (39002030131) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13103020093 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13103020003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6551510046 + 6551510047.
It is an arithmetic number, because the mean of its divisors is an integer number (6551510047).
Almost surely, 213103020093 is an apocalyptic number.
It is an amenable number.
13103020093 is a deficient number, since it is larger than the sum of its proper divisors (1).
13103020093 is an equidigital number, since it uses as much as digits as its factorization.
13103020093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 22.
The spelling of 13103020093 in words is "thirteen billion, one hundred three million, twenty thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •