Base | Representation |
---|---|
bin | 10010101000101100… |
… | …100000110010111001 |
3 | 1220122112112220202021 |
4 | 102220230200302321 |
5 | 311440042011022 |
6 | 13105330034441 |
7 | 1305604062343 |
oct | 225054406271 |
9 | 56575486667 |
10 | 20010110137 |
11 | 8539204a06 |
12 | 3a65418a21 |
13 | 1b6b807674 |
14 | d7b798293 |
15 | 7c1ab67c7 |
hex | 4a8b20cb9 |
20010110137 has 2 divisors, whose sum is σ = 20010110138. Its totient is φ = 20010110136.
The previous prime is 20010110047. The next prime is 20010110161. The reversal of 20010110137 is 73101101002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16347923881 + 3662186256 = 127859^2 + 60516^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20010110137 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20010110137.
It is not a weakly prime, because it can be changed into another prime (20010170137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10005055068 + 10005055069.
It is an arithmetic number, because the mean of its divisors is an integer number (10005055069).
Almost surely, 220010110137 is an apocalyptic number.
It is an amenable number.
20010110137 is a deficient number, since it is larger than the sum of its proper divisors (1).
20010110137 is an equidigital number, since it uses as much as digits as its factorization.
20010110137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 42, while the sum is 16.
Adding to 20010110137 its reverse (73101101002), we get a palindrome (93111211139).
The spelling of 20010110137 in words is "twenty billion, ten million, one hundred ten thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •