Base | Representation |
---|---|
bin | 1010000000011001101110… |
… | …0111001111100101101001 |
3 | 1102221210010211101222020101 |
4 | 2200012123213033211221 |
5 | 2420224120113013001 |
6 | 35222131550025401 |
7 | 2213604235000063 |
oct | 240063347174551 |
9 | 42853124358211 |
10 | 11002022001001 |
11 | 3561a27663219 |
12 | 1298322aa8261 |
13 | 61a642302555 |
14 | 2a0701d1a733 |
15 | 1412c3e65a01 |
hex | a019b9cf969 |
11002022001001 has 32 divisors (see below), whose sum is σ = 11507135777280. Its totient is φ = 10509748704000.
The previous prime is 11002022000993. The next prime is 11002022001083. The reversal of 11002022001001 is 10010022020011.
11002022001001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 11002022001001 - 23 = 11002022000993 is a prime.
It is a super-2 number, since 2×110020220010012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11002022091001) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 699554800 + ... + 699570526.
It is an arithmetic number, because the mean of its divisors is an integer number (359597993040).
Almost surely, 211002022001001 is an apocalyptic number.
It is an amenable number.
11002022001001 is a deficient number, since it is larger than the sum of its proper divisors (505113776279).
11002022001001 is a wasteful number, since it uses less digits than its factorization.
11002022001001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17425.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 11002022001001 its reverse (10010022020011), we get a palindrome (21012044021012).
The spelling of 11002022001001 in words is "eleven trillion, two billion, twenty-two million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •