Base | Representation |
---|---|
bin | 1001001001010011110110… |
… | …00101110110011010011101 |
3 | 2122012121021021111102222102 |
4 | 10210221323011312122131 |
5 | 10114000014103323122 |
6 | 110434525051454445 |
7 | 4143656566362332 |
oct | 444517305663235 |
9 | 78177237442872 |
10 | 20111102011037 |
11 | 6454085876374 |
12 | 23097bb457425 |
13 | b2b612bb6a7b |
14 | 4d754d944989 |
15 | 24d208ab0492 |
hex | 124a7b17669d |
20111102011037 has 2 divisors, whose sum is σ = 20111102011038. Its totient is φ = 20111102011036.
The previous prime is 20111102010977. The next prime is 20111102011097. The reversal of 20111102011037 is 73011020111102.
It is a balanced prime because it is at equal distance from previous prime (20111102010977) and next prime (20111102011097).
It can be written as a sum of positive squares in only one way, i.e., 11911292223076 + 8199809787961 = 3451274^2 + 2863531^2 .
It is a cyclic number.
It is not a de Polignac number, because 20111102011037 - 26 = 20111102010973 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20111102011097) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10055551005518 + 10055551005519.
It is an arithmetic number, because the mean of its divisors is an integer number (10055551005519).
Almost surely, 220111102011037 is an apocalyptic number.
It is an amenable number.
20111102011037 is a deficient number, since it is larger than the sum of its proper divisors (1).
20111102011037 is an equidigital number, since it uses as much as digits as its factorization.
20111102011037 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 84, while the sum is 20.
Adding to 20111102011037 its reverse (73011020111102), we get a palindrome (93122122122139).
The spelling of 20111102011037 in words is "twenty trillion, one hundred eleven billion, one hundred two million, eleven thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •