Base | Representation |
---|---|
bin | 1001001001010001111110… |
… | …11111100100111000110101 |
3 | 2122012111200121000211010111 |
4 | 10210220333133210320311 |
5 | 10113440442120401122 |
6 | 110434241532423021 |
7 | 4143623035433134 |
oct | 444507737447065 |
9 | 78174617024114 |
10 | 20110102122037 |
11 | 6453712418a24 |
12 | 2309580617a71 |
13 | b2b4b39b8285 |
14 | 4d7496c2591b |
15 | 24d19ae01d77 |
hex | 124a3f7e4e35 |
20110102122037 has 2 divisors, whose sum is σ = 20110102122038. Its totient is φ = 20110102122036.
The previous prime is 20110102122007. The next prime is 20110102122083. The reversal of 20110102122037 is 73022120101102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 17081019460561 + 3029082661476 = 4132919^2 + 1740426^2 .
It is a cyclic number.
It is not a de Polignac number, because 20110102122037 - 227 = 20109967904309 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20110102121999 and 20110102122017.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20110102122007) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10055051061018 + 10055051061019.
It is an arithmetic number, because the mean of its divisors is an integer number (10055051061019).
Almost surely, 220110102122037 is an apocalyptic number.
It is an amenable number.
20110102122037 is a deficient number, since it is larger than the sum of its proper divisors (1).
20110102122037 is an equidigital number, since it uses as much as digits as its factorization.
20110102122037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 336, while the sum is 22.
Adding to 20110102122037 its reverse (73022120101102), we get a palindrome (93132222223139).
The spelling of 20110102122037 in words is "twenty trillion, one hundred ten billion, one hundred two million, one hundred twenty-two thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •