Base | Representation |
---|---|
bin | 1010000000010101111011… |
… | …0101000101111010011011 |
3 | 1102221200111202111210100112 |
4 | 2200011132311011322123 |
5 | 2420220023032034321 |
6 | 35221442440354535 |
7 | 2213540043005132 |
oct | 240053665057233 |
9 | 42850452453315 |
10 | 11001002221211 |
11 | 3561553a5a602 |
12 | 1298099475a4b |
13 | 61a50bc5b262 |
14 | 2a0646700919 |
15 | 141264678a5b |
hex | a015ed45e9b |
11001002221211 has 4 divisors (see below), whose sum is σ = 11003998956624. Its totient is φ = 10998005485800.
The previous prime is 11001002221163. The next prime is 11001002221217. The reversal of 11001002221211 is 11212220010011.
11001002221211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11001002221211 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11001002221217) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1498362200 + ... + 1498369541.
It is an arithmetic number, because the mean of its divisors is an integer number (2750999739156).
Almost surely, 211001002221211 is an apocalyptic number.
11001002221211 is a deficient number, since it is larger than the sum of its proper divisors (2996735413).
11001002221211 is an equidigital number, since it uses as much as digits as its factorization.
11001002221211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2996735412.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 11001002221211 its reverse (11212220010011), we get a palindrome (22213222231222).
The spelling of 11001002221211 in words is "eleven trillion, one billion, two million, two hundred twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •