Base | Representation |
---|---|
bin | 1010000000011001101001… |
… | …0011010110111101011110 |
3 | 1102221210002022000202202200 |
4 | 2200012122103112331132 |
5 | 2420224044000323402 |
6 | 35222125442432330 |
7 | 2213603550042432 |
oct | 240063223267536 |
9 | 42853068022680 |
10 | 11002000011102 |
11 | 3561a16203951 |
12 | 12983176626a6 |
13 | 61a63a8a3489 |
14 | 2a06dd0349c2 |
15 | 1412c207021c |
hex | a019a4d6f5e |
11002000011102 has 12 divisors (see below), whose sum is σ = 23837666690760. Its totient is φ = 3667333337028.
The previous prime is 11002000011073. The next prime is 11002000011103. The reversal of 11002000011102 is 20111000020011.
It is a happy number.
11002000011102 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11002000011103) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 305611111402 + ... + 305611111437.
It is an arithmetic number, because the mean of its divisors is an integer number (1986472224230).
Almost surely, 211002000011102 is an apocalyptic number.
11002000011102 is an abundant number, since it is smaller than the sum of its proper divisors (12835666679658).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11002000011102 is a wasteful number, since it uses less digits than its factorization.
11002000011102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 611222222847 (or 611222222844 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 11002000011102 its reverse (20111000020011), we get a palindrome (31113000031113).
The spelling of 11002000011102 in words is "eleven trillion, two billion, eleven thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •