Base | Representation |
---|---|
bin | 110011110010011100… |
… | …0001011000110011101 |
3 | 101122001200222022112221 |
4 | 1213210320023012131 |
5 | 3310231303110211 |
6 | 123031400225341 |
7 | 11014663236013 |
oct | 1474470130635 |
9 | 348050868487 |
10 | 111214113181 |
11 | 43190516336 |
12 | 1967946b251 |
13 | a644bc3182 |
14 | 55505488b3 |
15 | 2d5d9bec71 |
hex | 19e4e0b19d |
111214113181 has 2 divisors, whose sum is σ = 111214113182. Its totient is φ = 111214113180.
The previous prime is 111214113167. The next prime is 111214113187. The reversal of 111214113181 is 181311412111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 93335749081 + 17878364100 = 305509^2 + 133710^2 .
It is a cyclic number.
It is not a de Polignac number, because 111214113181 - 211 = 111214111133 is a prime.
It is a super-2 number, since 2×1112141131812 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111214113187) 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, 55607056590 + 55607056591.
It is an arithmetic number, because the mean of its divisors is an integer number (55607056591).
Almost surely, 2111214113181 is an apocalyptic number.
It is an amenable number.
111214113181 is a deficient number, since it is larger than the sum of its proper divisors (1).
111214113181 is an equidigital number, since it uses as much as digits as its factorization.
111214113181 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 192, while the sum is 25.
Adding to 111214113181 its reverse (181311412111), we get a palindrome (292525525292).
The spelling of 111214113181 in words is "one hundred eleven billion, two hundred fourteen million, one hundred thirteen thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •