Base | Representation |
---|---|
bin | 110011101111000010… |
… | …0111010001010010101 |
3 | 101121202202021100000001 |
4 | 1213132010322022111 |
5 | 3310013100324112 |
6 | 123012202451301 |
7 | 11012106341032 |
oct | 1473604721225 |
9 | 347682240001 |
10 | 111100011157 |
11 | 43132072843 |
12 | 19647203b31 |
13 | a627382995 |
14 | 553d326389 |
15 | 2d53981c57 |
hex | 19de13a295 |
111100011157 has 2 divisors, whose sum is σ = 111100011158. Its totient is φ = 111100011156.
The previous prime is 111100011149. The next prime is 111100011161. The reversal of 111100011157 is 751110001111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 102990288241 + 8109722916 = 320921^2 + 90054^2 .
It is a cyclic number.
It is not a de Polignac number, because 111100011157 - 23 = 111100011149 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111100011257) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55550005578 + 55550005579.
It is an arithmetic number, because the mean of its divisors is an integer number (55550005579).
Almost surely, 2111100011157 is an apocalyptic number.
It is an amenable number.
111100011157 is a deficient number, since it is larger than the sum of its proper divisors (1).
111100011157 is an equidigital number, since it uses as much as digits as its factorization.
111100011157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 35, while the sum is 19.
Adding to 111100011157 its reverse (751110001111), we get a palindrome (862210012268).
The spelling of 111100011157 in words is "one hundred eleven billion, one hundred million, eleven thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •