Base | Representation |
---|---|
bin | 1010000000110111011101… |
… | …0000111100111000010101 |
3 | 1102222112201222101121120210 |
4 | 2200031313100330320111 |
5 | 2420341441020041041 |
6 | 35225531455320033 |
7 | 2214306054552633 |
oct | 240156720747025 |
9 | 42875658347523 |
10 | 11010002112021 |
11 | 35653521867a0 |
12 | 129998b520019 |
13 | 61b3146a0933 |
14 | 2a0c5bac8353 |
15 | 1415de833016 |
hex | a037743ce15 |
11010002112021 has 32 divisors (see below), whose sum is σ = 16095923020800. Its totient is φ = 6638826268800.
The previous prime is 11010002111819. The next prime is 11010002112041. The reversal of 11010002112021 is 12021120001011.
It is not a de Polignac number, because 11010002112021 - 210 = 11010002110997 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11010002111988 and 11010002112006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11010002112041) 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, 158170801 + ... + 158240393.
It is an arithmetic number, because the mean of its divisors is an integer number (502997594400).
Almost surely, 211010002112021 is an apocalyptic number.
11010002112021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11010002112021 is a deficient number, since it is larger than the sum of its proper divisors (5085920908779).
11010002112021 is a wasteful number, since it uses less digits than its factorization.
11010002112021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 93897.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 11010002112021 its reverse (12021120001011), we get a palindrome (23031122113032).
The spelling of 11010002112021 in words is "eleven trillion, ten billion, two million, one hundred twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •