Base | Representation |
---|---|
bin | 1101010001111… |
… | …10011110110101 |
3 | 21202121221220102 |
4 | 12220332132311 |
5 | 212004424411 |
6 | 15015443445 |
7 | 2521632602 |
oct | 650763665 |
9 | 252557812 |
10 | 111404981 |
11 | 57981236 |
12 | 31386585 |
13 | 1a107a0c |
14 | 10b1d6a9 |
15 | 9ba8d3b |
hex | 6a3e7b5 |
111404981 has 2 divisors, whose sum is σ = 111404982. Its totient is φ = 111404980.
The previous prime is 111404941. The next prime is 111404983. The reversal of 111404981 is 189404111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 101324356 + 10080625 = 10066^2 + 3175^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-111404981 is a prime.
It is a super-2 number, since 2×1114049812 = 24822139583220722, which contains 22 as substring.
It is a Sophie Germain prime.
Together with 111404983, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111404983) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55702490 + 55702491.
It is an arithmetic number, because the mean of its divisors is an integer number (55702491).
Almost surely, 2111404981 is an apocalyptic number.
It is an amenable number.
111404981 is a deficient number, since it is larger than the sum of its proper divisors (1).
111404981 is an equidigital number, since it uses as much as digits as its factorization.
111404981 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 29.
The square root of 111404981 is about 10554.8558019520. The cubic root of 111404981 is about 481.1733173823.
The spelling of 111404981 in words is "one hundred eleven million, four hundred four thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •