Base | Representation |
---|---|
bin | 1010000000111011100101… |
… | …0111011100010110000101 |
3 | 1102222122121021011112211210 |
4 | 2200032321113130112011 |
5 | 2420401223421010041 |
6 | 35230233513122033 |
7 | 2214345412103151 |
oct | 240167127342605 |
9 | 42878537145753 |
10 | 11011111110021 |
11 | 3565871187370 |
12 | 129a03a9b9319 |
13 | 61b460382079 |
14 | 2a0d250ca061 |
15 | 141656d95016 |
hex | a03b95dc585 |
11011111110021 has 32 divisors (see below), whose sum is σ = 16093510479360. Its totient is φ = 6641177659200.
The previous prime is 11011111110019. The next prime is 11011111110067. The reversal of 11011111110021 is 12001111111011.
It is not a de Polignac number, because 11011111110021 - 21 = 11011111110019 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11011111109979 and 11011111110006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11011111110221) 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, 84904695 + ... + 85034283.
It is an arithmetic number, because the mean of its divisors is an integer number (502922202480).
Almost surely, 211011111110021 is an apocalyptic number.
11011111110021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11011111110021 is a deficient number, since it is larger than the sum of its proper divisors (5082399369339).
11011111110021 is a wasteful number, since it uses less digits than its factorization.
11011111110021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 142017.
The product of its (nonzero) digits is 2, while the sum is 12.
Adding to 11011111110021 its reverse (12001111111011), we get a palindrome (23012222221032).
The spelling of 11011111110021 in words is "eleven trillion, eleven billion, one hundred eleven million, one hundred ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •