Base | Representation |
---|---|
bin | 1101001111101… |
… | …00010111000101 |
3 | 21202001112102222 |
4 | 12213310113011 |
5 | 211420221011 |
6 | 15005142125 |
7 | 2516226506 |
oct | 647642705 |
9 | 252045388 |
10 | 111101381 |
11 | 57794126 |
12 | 3125a945 |
13 | 1a02c781 |
14 | 10a80bad |
15 | 9b48ddb |
hex | 69f45c5 |
111101381 has 2 divisors, whose sum is σ = 111101382. Its totient is φ = 111101380.
The previous prime is 111101377. The next prime is 111101423. The reversal of 111101381 is 183101111.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 103205281 + 7896100 = 10159^2 + 2810^2 .
It is an emirp because it is prime and its reverse (183101111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 111101381 - 22 = 111101377 is a prime.
It is a super-2 number, since 2×1111013812 = 24687033720214322, which contains 22 as substring.
It is a Sophie Germain 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 (111101311) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55550690 + 55550691.
It is an arithmetic number, because the mean of its divisors is an integer number (55550691).
Almost surely, 2111101381 is an apocalyptic number.
It is an amenable number.
111101381 is a deficient number, since it is larger than the sum of its proper divisors (1).
111101381 is an equidigital number, since it uses as much as digits as its factorization.
111101381 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 17.
The square root of 111101381 is about 10540.4639840948. The cubic root of 111101381 is about 480.7358231109.
Adding to 111101381 its reverse (183101111), we get a palindrome (294202492).
The spelling of 111101381 in words is "one hundred eleven million, one hundred one thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •