Base | Representation |
---|---|
bin | 1001001001010011110111… |
… | …01011111111110100001101 |
3 | 2122012121021222022111101012 |
4 | 10210221323223333310031 |
5 | 10114000024133323041 |
6 | 110434530050055005 |
7 | 4143660050361653 |
oct | 444517353776415 |
9 | 78177258274335 |
10 | 20111112011021 |
11 | 6454090486519 |
12 | 230980287a465 |
13 | b2b614ca8615 |
14 | 4d7550dc8dd3 |
15 | 24d2098d83eb |
hex | 124a7baffd0d |
20111112011021 has 2 divisors, whose sum is σ = 20111112011022. Its totient is φ = 20111112011020.
The previous prime is 20111112011017. The next prime is 20111112011041. The reversal of 20111112011021 is 12011021111102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19060253298025 + 1050858712996 = 4365805^2 + 1025114^2 .
It is a cyclic number.
It is not a de Polignac number, because 20111112011021 - 22 = 20111112011017 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20111112010987 and 20111112011005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20111112011041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10055556005510 + 10055556005511.
It is an arithmetic number, because the mean of its divisors is an integer number (10055556005511).
Almost surely, 220111112011021 is an apocalyptic number.
It is an amenable number.
20111112011021 is a deficient number, since it is larger than the sum of its proper divisors (1).
20111112011021 is an equidigital number, since it uses as much as digits as its factorization.
20111112011021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 20111112011021 its reverse (12011021111102), we get a palindrome (32122133122123).
The spelling of 20111112011021 in words is "twenty trillion, one hundred eleven billion, one hundred twelve million, eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •