Base | Representation |
---|---|
bin | 1010001100100001010101… |
… | …0011111111010001101011 |
3 | 1110200200112122211010112101 |
4 | 2203020111103333101223 |
5 | 2432132013341012021 |
6 | 35501523250554231 |
7 | 2234624520345355 |
oct | 243102523772153 |
9 | 43620478733471 |
10 | 11210222204011 |
11 | 36322572032a6 |
12 | 1310748898977 |
13 | 63417249034c |
14 | 2aa8130dc0d5 |
15 | 14690c27ea91 |
hex | a32154ff46b |
11210222204011 has 2 divisors, whose sum is σ = 11210222204012. Its totient is φ = 11210222204010.
The previous prime is 11210222204009. The next prime is 11210222204017. The reversal of 11210222204011 is 11040222201211.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11210222204011 - 21 = 11210222204009 is a prime.
Together with 11210222204009, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 11210222204011.
It is not a weakly prime, because it can be changed into another prime (11210222204017) 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, 5605111102005 + 5605111102006.
It is an arithmetic number, because the mean of its divisors is an integer number (5605111102006).
Almost surely, 211210222204011 is an apocalyptic number.
11210222204011 is a deficient number, since it is larger than the sum of its proper divisors (1).
11210222204011 is an equidigital number, since it uses as much as digits as its factorization.
11210222204011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 11210222204011 its reverse (11040222201211), we get a palindrome (22250444405222).
The spelling of 11210222204011 in words is "eleven trillion, two hundred ten billion, two hundred twenty-two million, two hundred four thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •