Base | Representation |
---|---|
bin | 110011101111010111… |
… | …1001101111000101001 |
3 | 101121210112010210202202 |
4 | 1213132233031320221 |
5 | 3310023420230433 |
6 | 123013240305545 |
7 | 11012302532603 |
oct | 1473657157051 |
9 | 347715123682 |
10 | 111111101993 |
11 | 43138358521 |
12 | 1964aa722b5 |
13 | a629766bc8 |
14 | 55409b2173 |
15 | 2d54922ee8 |
hex | 19debcde29 |
111111101993 has 2 divisors, whose sum is σ = 111111101994. Its totient is φ = 111111101992.
The previous prime is 111111101951. The next prime is 111111102013. The reversal of 111111101993 is 399101111111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 103341032089 + 7770069904 = 321467^2 + 88148^2 .
It is an emirp because it is prime and its reverse (399101111111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 111111101993 - 26 = 111111101929 is a prime.
It is not a weakly prime, because it can be changed into another prime (111111103993) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55555550996 + 55555550997.
It is an arithmetic number, because the mean of its divisors is an integer number (55555550997).
Almost surely, 2111111101993 is an apocalyptic number.
It is an amenable number.
111111101993 is a deficient number, since it is larger than the sum of its proper divisors (1).
111111101993 is an equidigital number, since it uses as much as digits as its factorization.
111111101993 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 243, while the sum is 29.
The spelling of 111111101993 in words is "one hundred eleven billion, one hundred eleven million, one hundred one thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •