Base | Representation |
---|---|
bin | 1010000000010101111011… |
… | …0000011100000100000101 |
3 | 1102221200111200012210211201 |
4 | 2200011132300130010011 |
5 | 2420220022224014341 |
6 | 35221442354302501 |
7 | 2213540026434250 |
oct | 240053660340405 |
9 | 42850450183751 |
10 | 11001001001221 |
11 | 35615532a6a50 |
12 | 1298098b87a31 |
13 | 61a50b921b7a |
14 | 2a06464a4097 |
15 | 1412644d7331 |
hex | a015ec1c105 |
11001001001221 has 16 divisors (see below), whose sum is σ = 13721265468288. Its totient is φ = 8568626227200.
The previous prime is 11001001001213. The next prime is 11001001001227. The reversal of 11001001001221 is 12210010010011.
It is a cyclic number.
It is not a de Polignac number, because 11001001001221 - 23 = 11001001001213 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11001001001198 and 11001001001207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11001001001227) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 29667420 + ... + 30035941.
It is an arithmetic number, because the mean of its divisors is an integer number (857579091768).
Almost surely, 211001001001221 is an apocalyptic number.
11001001001221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11001001001221 is a deficient number, since it is larger than the sum of its proper divisors (2720264467067).
11001001001221 is a wasteful number, since it uses less digits than its factorization.
11001001001221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 59705772.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 11001001001221 its reverse (12210010010011), we get a palindrome (23211011011232).
The spelling of 11001001001221 in words is "eleven trillion, one billion, one million, one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •