Base | Representation |
---|---|
bin | 110011110010000011… |
… | …0100010100100111111 |
3 | 101122000210111021202122 |
4 | 1213210012202210333 |
5 | 3310214440232033 |
6 | 123030213313155 |
7 | 11014444525655 |
oct | 1474406424477 |
9 | 348023437678 |
10 | 111201102143 |
11 | 43184139a0a |
12 | 196750357bb |
13 | a6422b8c31 |
14 | 554c91cdd5 |
15 | 2d5c79ea98 |
hex | 19e41a293f |
111201102143 has 2 divisors, whose sum is σ = 111201102144. Its totient is φ = 111201102142.
The previous prime is 111201102109. The next prime is 111201102157. The reversal of 111201102143 is 341201102111.
It is a strong prime.
It is an emirp because it is prime and its reverse (341201102111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 111201102143 - 26 = 111201102079 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111201102743) 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, 55600551071 + 55600551072.
It is an arithmetic number, because the mean of its divisors is an integer number (55600551072).
Almost surely, 2111201102143 is an apocalyptic number.
111201102143 is a deficient number, since it is larger than the sum of its proper divisors (1).
111201102143 is an equidigital number, since it uses as much as digits as its factorization.
111201102143 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 111201102143 its reverse (341201102111), we get a palindrome (452402204254).
The spelling of 111201102143 in words is "one hundred eleven billion, two hundred one million, one hundred two thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •