Base | Representation |
---|---|
bin | 1010000000110111011100… |
… | …1000111011101100011101 |
3 | 1102222112201211102211011122 |
4 | 2200031313020323230131 |
5 | 2420341440000310023 |
6 | 35225531342300325 |
7 | 2214306030646424 |
oct | 240156710735435 |
9 | 42875654384148 |
10 | 11010000010013 |
11 | 3565350a804a4 |
12 | 129998a8876a5 |
13 | 61b314115c44 |
14 | 2a0c5b6dc2bb |
15 | 1415de56a2c8 |
hex | a037723bb1d |
11010000010013 has 2 divisors, whose sum is σ = 11010000010014. Its totient is φ = 11010000010012.
The previous prime is 11010000009971. The next prime is 11010000010019. The reversal of 11010000010013 is 31001000001011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9598366123129 + 1411633886884 = 3098123^2 + 1188122^2 .
It is a cyclic number.
It is not a de Polignac number, because 11010000010013 - 218 = 11009999747869 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11010000010019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505000005006 + 5505000005007.
It is an arithmetic number, because the mean of its divisors is an integer number (5505000005007).
Almost surely, 211010000010013 is an apocalyptic number.
It is an amenable number.
11010000010013 is a deficient number, since it is larger than the sum of its proper divisors (1).
11010000010013 is an equidigital number, since it uses as much as digits as its factorization.
11010000010013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3, while the sum is 8.
Adding to 11010000010013 its reverse (31001000001011), we get a palindrome (42011000011024).
The spelling of 11010000010013 in words is "eleven trillion, ten billion, ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •