Base | Representation |
---|---|
bin | 110011101100010110… |
… | …1100101010001010101 |
3 | 101121112110220210220011 |
4 | 1213120231211101111 |
5 | 3304322030311242 |
6 | 122555225440221 |
7 | 11006634342412 |
oct | 1473055452125 |
9 | 347473823804 |
10 | 111010010197 |
11 | 43096290789 |
12 | 19621040071 |
13 | a611830488 |
14 | 55313b9109 |
15 | 2d4ab04d17 |
hex | 19d8b65455 |
111010010197 has 2 divisors, whose sum is σ = 111010010198. Its totient is φ = 111010010196.
The previous prime is 111010010179. The next prime is 111010010203. The reversal of 111010010197 is 791010010111.
Together with previous prime (111010010179) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 90667834321 + 20342175876 = 301111^2 + 142626^2 .
It is an emirp because it is prime and its reverse (791010010111) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-111010010197 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111010013197) 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, 55505005098 + 55505005099.
It is an arithmetic number, because the mean of its divisors is an integer number (55505005099).
Almost surely, 2111010010197 is an apocalyptic number.
It is an amenable number.
111010010197 is a deficient number, since it is larger than the sum of its proper divisors (1).
111010010197 is an equidigital number, since it uses as much as digits as its factorization.
111010010197 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 63, while the sum is 22.
The spelling of 111010010197 in words is "one hundred eleven billion, ten million, ten thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •