Base | Representation |
---|---|
bin | 1010000000111011100011… |
… | …0100101100101111001001 |
3 | 1102222122120122000211011011 |
4 | 2200032320310230233021 |
5 | 2420401214103031441 |
6 | 35230232550003521 |
7 | 2214345241510414 |
oct | 240167064545711 |
9 | 42878518024134 |
10 | 11011102002121 |
11 | 3565867026481 |
12 | 129a0379465a1 |
13 | 61b45b513590 |
14 | 2a0d23bd8b7b |
15 | 141656196581 |
hex | a03b8d2cbc9 |
11011102002121 has 16 divisors (see below), whose sum is σ = 11864154649536. Its totient is φ = 10158914074176.
The previous prime is 11011102001987. The next prime is 11011102002193. The reversal of 11011102002121 is 12120020111011.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 11011102002121 - 29 = 11011102001609 is a prime.
It is a super-2 number, since 2×110111020021212 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11011102012121) 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, 287229471 + ... + 287267803.
It is an arithmetic number, because the mean of its divisors is an integer number (741509665596).
Almost surely, 211011102002121 is an apocalyptic number.
It is an amenable number.
11011102002121 is a deficient number, since it is larger than the sum of its proper divisors (853052647415).
11011102002121 is a wasteful number, since it uses less digits than its factorization.
11011102002121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49032.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11011102002121 its reverse (12120020111011), we get a palindrome (23131122113132).
The spelling of 11011102002121 in words is "eleven trillion, eleven billion, one hundred two million, two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •