Base | Representation |
---|---|
bin | 1010000000111000001111… |
… | …0001011010110110111101 |
3 | 1102222120021121020111012021 |
4 | 2200032003301122312331 |
5 | 2420342403224400023 |
6 | 35230004353040141 |
7 | 2214314213263333 |
oct | 240160361326675 |
9 | 42876247214167 |
10 | 11010211950013 |
11 | 356544a679121 |
12 | 1299a29856051 |
13 | 61b348cc0b23 |
14 | 2a0c7b90bb53 |
15 | 141602e8235d |
hex | a0383c5adbd |
11010211950013 has 2 divisors, whose sum is σ = 11010211950014. Its totient is φ = 11010211950012.
The previous prime is 11010211949999. The next prime is 11010211950047. The reversal of 11010211950013 is 31005911201011.
11010211950013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10364909813764 + 645302136249 = 3219458^2 + 803307^2 .
It is a cyclic number.
It is not a de Polignac number, because 11010211950013 - 29 = 11010211949501 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11010211950013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11010211950713) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505105975006 + 5505105975007.
It is an arithmetic number, because the mean of its divisors is an integer number (5505105975007).
Almost surely, 211010211950013 is an apocalyptic number.
It is an amenable number.
11010211950013 is a deficient number, since it is larger than the sum of its proper divisors (1).
11010211950013 is an equidigital number, since it uses as much as digits as its factorization.
11010211950013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 270, while the sum is 25.
The spelling of 11010211950013 in words is "eleven trillion, ten billion, two hundred eleven million, nine hundred fifty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •