Base | Representation |
---|---|
bin | 10100110111010000… |
… | …11101100101011101 |
3 | 1001220121200021010201 |
4 | 22123220131211131 |
5 | 140414424310023 |
6 | 5051244303501 |
7 | 544400004604 |
oct | 123350354535 |
9 | 31817607121 |
10 | 11201010013 |
11 | 4828750676 |
12 | 2207241b91 |
13 | 109677659b |
14 | 783876a3b |
15 | 458547bad |
hex | 29ba1d95d |
11201010013 has 2 divisors, whose sum is σ = 11201010014. Its totient is φ = 11201010012.
The previous prime is 11201010001. The next prime is 11201010053. The reversal of 11201010013 is 31001010211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9261752644 + 1939257369 = 96238^2 + 44037^2 .
It is an emirp because it is prime and its reverse (31001010211) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11201010013 is a prime.
It is a super-2 number, since 2×112010100132 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11201010053) 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, 5600505006 + 5600505007.
It is an arithmetic number, because the mean of its divisors is an integer number (5600505007).
Almost surely, 211201010013 is an apocalyptic number.
It is an amenable number.
11201010013 is a deficient number, since it is larger than the sum of its proper divisors (1).
11201010013 is an equidigital number, since it uses as much as digits as its factorization.
11201010013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6, while the sum is 10.
Adding to 11201010013 its reverse (31001010211), we get a palindrome (42202020224).
The spelling of 11201010013 in words is "eleven billion, two hundred one million, ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •