Base | Representation |
---|---|
bin | 100001000111011… |
… | …0110101001111101 |
3 | 2212102220022022102 |
4 | 1002032312221331 |
5 | 4233431041031 |
6 | 302132354445 |
7 | 36351650255 |
oct | 10216665175 |
9 | 2772808272 |
10 | 1111190141 |
11 | 520268666 |
12 | 270175a25 |
13 | 14929b179 |
14 | a7812965 |
15 | 678467cb |
hex | 423b6a7d |
1111190141 has 2 divisors, whose sum is σ = 1111190142. Its totient is φ = 1111190140.
The previous prime is 1111190117. The next prime is 1111190173. The reversal of 1111190141 is 1410911111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 999887641 + 111302500 = 31621^2 + 10550^2 .
It is a cyclic number.
It is not a de Polignac number, because 1111190141 - 210 = 1111189117 is a prime.
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 (1111190741) 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, 555595070 + 555595071.
It is an arithmetic number, because the mean of its divisors is an integer number (555595071).
Almost surely, 21111190141 is an apocalyptic number.
It is an amenable number.
1111190141 is a deficient number, since it is larger than the sum of its proper divisors (1).
1111190141 is an equidigital number, since it uses as much as digits as its factorization.
1111190141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 20.
The square root of 1111190141 is about 33334.5187605881. The cubic root of 1111190141 is about 1035.7687244931.
The spelling of 1111190141 in words is "one billion, one hundred eleven million, one hundred ninety thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •