Base | Representation |
---|---|
bin | 110011101100101010… |
… | …0000011101010001001 |
3 | 101121120011220020012111 |
4 | 1213121110003222021 |
5 | 3304332121034022 |
6 | 123000225542321 |
7 | 11010116150446 |
oct | 1473124035211 |
9 | 347504806174 |
10 | 111020096137 |
11 | 430a0a4a475 |
12 | 196244a49a1 |
13 | a6139521a2 |
14 | 55328829cd |
15 | 2d4b948477 |
hex | 19d9503a89 |
111020096137 has 2 divisors, whose sum is σ = 111020096138. Its totient is φ = 111020096136.
The previous prime is 111020096093. The next prime is 111020096141. The reversal of 111020096137 is 731690020111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 109912803961 + 1107292176 = 331531^2 + 33276^2 .
It is a cyclic number.
It is not a de Polignac number, because 111020096137 - 235 = 76660357769 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 111020096099 and 111020096108.
It is not a weakly prime, because it can be changed into another prime (111020099137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55510048068 + 55510048069.
It is an arithmetic number, because the mean of its divisors is an integer number (55510048069).
Almost surely, 2111020096137 is an apocalyptic number.
It is an amenable number.
111020096137 is a deficient number, since it is larger than the sum of its proper divisors (1).
111020096137 is an equidigital number, since it uses as much as digits as its factorization.
111020096137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2268, while the sum is 31.
The spelling of 111020096137 in words is "one hundred eleven billion, twenty million, ninety-six thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •