Base | Representation |
---|---|
bin | 1010000000011010000001… |
… | …1000011010111001000101 |
3 | 1102221210100101221101220111 |
4 | 2200012200120122321011 |
5 | 2420224301103014341 |
6 | 35222143524433021 |
7 | 2213606225663632 |
oct | 240064030327105 |
9 | 42853311841814 |
10 | 11002102001221 |
11 | 3561a68834601 |
12 | 1298345848771 |
13 | 61a655a62a66 |
14 | 2a070c7c3189 |
15 | 1412caeb9681 |
hex | a01a061ae45 |
11002102001221 has 8 divisors (see below), whose sum is σ = 11016600598080. Its totient is φ = 10987603903488.
The previous prime is 11002102001179. The next prime is 11002102001287. The reversal of 11002102001221 is 12210020120011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11002102001221 is a prime.
It is a super-2 number, since 2×110021020012212 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11002102001021) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 69305280 + ... + 69463846.
It is an arithmetic number, because the mean of its divisors is an integer number (1377075074760).
Almost surely, 211002102001221 is an apocalyptic number.
It is an amenable number.
11002102001221 is a deficient number, since it is larger than the sum of its proper divisors (14498596859).
11002102001221 is an equidigital number, since it uses as much as digits as its factorization.
11002102001221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 249563.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 11002102001221 its reverse (12210020120011), we get a palindrome (23212122121232).
The spelling of 11002102001221 in words is "eleven trillion, two billion, one hundred two million, one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •