Base | Representation |
---|---|
bin | 110011010111100000… |
… | …0000001001101001001 |
3 | 101112201201002202222001 |
4 | 1212233000001031021 |
5 | 3301403402401022 |
6 | 122401550231001 |
7 | 10653406142014 |
oct | 1465700011511 |
9 | 345651082861 |
10 | 110310200137 |
11 | 42867261065 |
12 | 194667b5461 |
13 | a52c859697 |
14 | 54a649037b |
15 | 2d0946db27 |
hex | 19af001349 |
110310200137 has 2 divisors, whose sum is σ = 110310200138. Its totient is φ = 110310200136.
The previous prime is 110310200069. The next prime is 110310200141. The reversal of 110310200137 is 731002013011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 106968897721 + 3341302416 = 327061^2 + 57804^2 .
It is an emirp because it is prime and its reverse (731002013011) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110310200137 is a prime.
It is not a weakly prime, because it can be changed into another prime (110310240137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55155100068 + 55155100069.
It is an arithmetic number, because the mean of its divisors is an integer number (55155100069).
Almost surely, 2110310200137 is an apocalyptic number.
It is an amenable number.
110310200137 is a deficient number, since it is larger than the sum of its proper divisors (1).
110310200137 is an equidigital number, since it uses as much as digits as its factorization.
110310200137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 126, while the sum is 19.
Adding to 110310200137 its reverse (731002013011), we get a palindrome (841312213148).
The spelling of 110310200137 in words is "one hundred ten billion, three hundred ten million, two hundred thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •