Base | Representation |
---|---|
bin | 1010001011111011101000… |
… | …0010101111101000000101 |
3 | 1110122201102022000211020021 |
4 | 2202332322002233220011 |
5 | 2432000301330202323 |
6 | 35453131054535141 |
7 | 2234115641620615 |
oct | 242767202575005 |
9 | 43581368024207 |
10 | 11200101022213 |
11 | 3628a3304a644 |
12 | 130a7a32074b1 |
13 | 63321b65408c |
14 | 2aa132c32a45 |
15 | 14651893605d |
hex | a2fba0afa05 |
11200101022213 has 2 divisors, whose sum is σ = 11200101022214. Its totient is φ = 11200101022212.
The previous prime is 11200101022199. The next prime is 11200101022223. The reversal of 11200101022213 is 31222010100211.
11200101022213 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9974877839809 + 1225223182404 = 3158303^2 + 1106898^2 .
It is a cyclic number.
It is not a de Polignac number, because 11200101022213 - 233 = 11191511087621 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11200101022223) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5600050511106 + 5600050511107.
It is an arithmetic number, because the mean of its divisors is an integer number (5600050511107).
Almost surely, 211200101022213 is an apocalyptic number.
It is an amenable number.
11200101022213 is a deficient number, since it is larger than the sum of its proper divisors (1).
11200101022213 is an equidigital number, since it uses as much as digits as its factorization.
11200101022213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 11200101022213 its reverse (31222010100211), we get a palindrome (42422111122424).
The spelling of 11200101022213 in words is "eleven trillion, two hundred billion, one hundred one million, twenty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •