Base | Representation |
---|---|
bin | 110011001110111000… |
… | …0110110001001110101 |
3 | 101111222112221101201121 |
4 | 1212131300312021311 |
5 | 3300310334310122 |
6 | 122313140023541 |
7 | 10643265104131 |
oct | 1463560661165 |
9 | 344875841647 |
10 | 110021010037 |
11 | 42728aa0284 |
12 | 193a5991bb1 |
13 | a4b4974c93 |
14 | 5479cd23c1 |
15 | 2cddd97bc7 |
hex | 199dc36275 |
110021010037 has 2 divisors, whose sum is σ = 110021010038. Its totient is φ = 110021010036.
The previous prime is 110021010019. The next prime is 110021010053. The reversal of 110021010037 is 730010120011.
It is an a-pointer prime, because the next prime (110021010053) can be obtained adding 110021010037 to its sum of digits (16).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 90633510916 + 19387499121 = 301054^2 + 139239^2 .
It is a cyclic number.
It is not a de Polignac number, because 110021010037 - 27 = 110021009909 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 110021010037.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110021010017) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55010505018 + 55010505019.
It is an arithmetic number, because the mean of its divisors is an integer number (55010505019).
Almost surely, 2110021010037 is an apocalyptic number.
It is an amenable number.
110021010037 is a deficient number, since it is larger than the sum of its proper divisors (1).
110021010037 is an equidigital number, since it uses as much as digits as its factorization.
110021010037 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 42, while the sum is 16.
Adding to 110021010037 its reverse (730010120011), we get a palindrome (840031130048).
The spelling of 110021010037 in words is "one hundred ten billion, twenty-one million, ten thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.133 sec. • engine limits •