Base | Representation |
---|---|
bin | 1001001001000011000101… |
… | …01001111111101001001101 |
3 | 2122011202001001121122212011 |
4 | 10210201202221333221031 |
5 | 10113323101120333122 |
6 | 110430440032541221 |
7 | 4143220554520066 |
oct | 444414251775115 |
9 | 78152031548764 |
10 | 20102102121037 |
11 | 645028764a852 |
12 | 2307b093b1811 |
13 | b2a80a474881 |
14 | 4d6d3855b56d |
15 | 24cd7d906377 |
hex | 124862a7fa4d |
20102102121037 has 2 divisors, whose sum is σ = 20102102121038. Its totient is φ = 20102102121036.
The previous prime is 20102102120939. The next prime is 20102102121053. The reversal of 20102102121037 is 73012120120102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 14370574049316 + 5731528071721 = 3790854^2 + 2394061^2 .
It is a cyclic number.
It is not a de Polignac number, because 20102102121037 - 215 = 20102102088269 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20102102120999 and 20102102121017.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20102102121077) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10051051060518 + 10051051060519.
It is an arithmetic number, because the mean of its divisors is an integer number (10051051060519).
Almost surely, 220102102121037 is an apocalyptic number.
It is an amenable number.
20102102121037 is a deficient number, since it is larger than the sum of its proper divisors (1).
20102102121037 is an equidigital number, since it uses as much as digits as its factorization.
20102102121037 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 336, while the sum is 22.
Adding to 20102102121037 its reverse (73012120120102), we get a palindrome (93114222241139).
The spelling of 20102102121037 in words is "twenty trillion, one hundred two billion, one hundred two million, one hundred twenty-one thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •