Base | Representation |
---|---|
bin | 1001001001010011101111… |
… | …01010000110001101000101 |
3 | 2122012121010021002201000211 |
4 | 10210221313222012031011 |
5 | 10113444404331412122 |
6 | 110434515233035421 |
7 | 4143655266623026 |
oct | 444516752061505 |
9 | 78177107081024 |
10 | 20111044404037 |
11 | 64540562aa384 |
12 | 23097a40b5b71 |
13 | b2b603c970a2 |
14 | 4d754602ac4d |
15 | 24d2039d1877 |
hex | 124a77a86345 |
20111044404037 has 2 divisors, whose sum is σ = 20111044404038. Its totient is φ = 20111044404036.
The previous prime is 20111044404029. The next prime is 20111044404043. The reversal of 20111044404037 is 73040444011102.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13667742454081 + 6443301949956 = 3696991^2 + 2538366^2 .
It is a cyclic number.
It is not a de Polignac number, because 20111044404037 - 23 = 20111044404029 is a prime.
It is a super-2 number, since 2×201110444040372 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20111044404067) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10055522202018 + 10055522202019.
It is an arithmetic number, because the mean of its divisors is an integer number (10055522202019).
Almost surely, 220111044404037 is an apocalyptic number.
It is an amenable number.
20111044404037 is a deficient number, since it is larger than the sum of its proper divisors (1).
20111044404037 is an equidigital number, since it uses as much as digits as its factorization.
20111044404037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10752, while the sum is 31.
Adding to 20111044404037 its reverse (73040444011102), we get a palindrome (93151488415139).
The spelling of 20111044404037 in words is "twenty trillion, one hundred eleven billion, forty-four million, four hundred four thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •