Base | Representation |
---|---|
bin | 110011001110010010… |
… | …0111011110001111001 |
3 | 101111221011111101012021 |
4 | 1212130210323301321 |
5 | 3300240241011022 |
6 | 122311145314441 |
7 | 10642634003002 |
oct | 1463444736171 |
9 | 344834441167 |
10 | 110001110137 |
11 | 42718839186 |
12 | 1939b195a21 |
13 | a4b07c82a9 |
14 | 54773d21a9 |
15 | 2cdc2667c7 |
hex | 199c93bc79 |
110001110137 has 2 divisors, whose sum is σ = 110001110138. Its totient is φ = 110001110136.
The previous prime is 110001110099. The next prime is 110001110143. The reversal of 110001110137 is 731011100011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 87325569081 + 22675541056 = 295509^2 + 150584^2 .
It is a cyclic number.
It is not a de Polignac number, because 110001110137 - 223 = 109992721529 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 110001110137.
It is not a weakly prime, because it can be changed into another prime (110001117137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55000555068 + 55000555069.
It is an arithmetic number, because the mean of its divisors is an integer number (55000555069).
Almost surely, 2110001110137 is an apocalyptic number.
It is an amenable number.
110001110137 is a deficient number, since it is larger than the sum of its proper divisors (1).
110001110137 is an equidigital number, since it uses as much as digits as its factorization.
110001110137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21, while the sum is 16.
Adding to 110001110137 its reverse (731011100011), we get a palindrome (841012210148).
The spelling of 110001110137 in words is "one hundred ten billion, one million, one hundred ten thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •