Base | Representation |
---|---|
bin | 1010000000011001101001… |
… | …1011010111101010000111 |
3 | 1102221210002102222110102210 |
4 | 2200012122123113222013 |
5 | 2420224100020023421 |
6 | 35222125555434503 |
7 | 2213603603640054 |
oct | 240063233275207 |
9 | 42853072873383 |
10 | 11002002111111 |
11 | 3561a174086a0 |
12 | 12983182b5a33 |
13 | 61a63b15a29b |
14 | 2a06dd42002b |
15 | 1412c2337576 |
hex | a019a6d7a87 |
11002002111111 has 24 divisors (see below), whose sum is σ = 16245326732544. Its totient is φ = 6568359380880.
The previous prime is 11002002111101. The next prime is 11002002111137. The reversal of 11002002111111 is 11111120020011.
It is not a de Polignac number, because 11002002111111 - 26 = 11002002111047 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11002002111101) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 36986415 + ... + 37282688.
It is an arithmetic number, because the mean of its divisors is an integer number (676888613856).
Almost surely, 211002002111111 is an apocalyptic number.
11002002111111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11002002111111 is a deficient number, since it is larger than the sum of its proper divisors (5243324621433).
11002002111111 is an equidigital number, since it uses as much as digits as its factorization.
11002002111111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74269251 (or 74269184 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 11002002111111 its reverse (11111120020011), we get a palindrome (22113122131122).
Subtracting 11002002111111 from its reverse (11111120020011), we obtain a square (109117908900 = 3303302).
The spelling of 11002002111111 in words is "eleven trillion, two billion, two million, one hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •