Base | Representation |
---|---|
bin | 1001001001010001111111… |
… | …11101101010111001110101 |
3 | 2122012111201010212121202012 |
4 | 10210220333331222321311 |
5 | 10113441001130322442 |
6 | 110434242413454005 |
7 | 4143623162461046 |
oct | 444507775527165 |
9 | 78174633777665 |
10 | 20110110010997 |
11 | 6453716917026 |
12 | 23095831a1305 |
13 | b2b4b551acb6 |
14 | 4d7497cba8cd |
15 | 24d19b95e582 |
hex | 124a3ff6ae75 |
20110110010997 has 2 divisors, whose sum is σ = 20110110010998. Its totient is φ = 20110110010996.
The previous prime is 20110110010973. The next prime is 20110110011003. The reversal of 20110110010997 is 79901001101102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12768036951121 + 7342073059876 = 3573239^2 + 2709626^2 .
It is a cyclic number.
It is not a de Polignac number, because 20110110010997 - 230 = 20109036269173 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20110110010297) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10055055005498 + 10055055005499.
It is an arithmetic number, because the mean of its divisors is an integer number (10055055005499).
Almost surely, 220110110010997 is an apocalyptic number.
It is an amenable number.
20110110010997 is a deficient number, since it is larger than the sum of its proper divisors (1).
20110110010997 is an equidigital number, since it uses as much as digits as its factorization.
20110110010997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1134, while the sum is 32.
The spelling of 20110110010997 in words is "twenty trillion, one hundred ten billion, one hundred ten million, ten thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •