Base | Representation |
---|---|
bin | 1010000001000011011100… |
… | …0100111110111001001101 |
3 | 1102222212001020210102101221 |
4 | 2200100313010332321031 |
5 | 2420420033332400023 |
6 | 35231223054203341 |
7 | 2214451602056443 |
oct | 240206704767115 |
9 | 42885036712357 |
10 | 11013220200013 |
11 | 3566753763949 |
12 | 129a5291b3551 |
13 | 61b708303505 |
14 | 2a1085260b93 |
15 | 14172c10585d |
hex | a043713ee4d |
11013220200013 has 2 divisors, whose sum is σ = 11013220200014. Its totient is φ = 11013220200012.
The previous prime is 11013220199929. The next prime is 11013220200049. The reversal of 11013220200013 is 31000202231011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8782433009289 + 2230787190724 = 2963517^2 + 1493582^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11013220200013 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11013220200013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11013220200413) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5506610100006 + 5506610100007.
It is an arithmetic number, because the mean of its divisors is an integer number (5506610100007).
Almost surely, 211013220200013 is an apocalyptic number.
It is an amenable number.
11013220200013 is a deficient number, since it is larger than the sum of its proper divisors (1).
11013220200013 is an equidigital number, since it uses as much as digits as its factorization.
11013220200013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 11013220200013 its reverse (31000202231011), we get a palindrome (42013422431024).
The spelling of 11013220200013 in words is "eleven trillion, thirteen billion, two hundred twenty million, two hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •