Base | Representation |
---|---|
bin | 100001000101100… |
… | …1110111101110101 |
3 | 2212101010002112021 |
4 | 1002023032331311 |
5 | 4233210204031 |
6 | 302100153141 |
7 | 36340615432 |
oct | 10213167565 |
9 | 2771102467 |
10 | 1110241141 |
11 | 51a77a669 |
12 | 26b9987b1 |
13 | 149028229 |
14 | a7646b89 |
15 | 6770a511 |
hex | 422cef75 |
1110241141 has 2 divisors, whose sum is σ = 1110241142. Its totient is φ = 1110241140.
The previous prime is 1110241063. The next prime is 1110241163. The reversal of 1110241141 is 1411420111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1023360100 + 86881041 = 31990^2 + 9321^2 .
It is a cyclic number.
It is not a de Polignac number, because 1110241141 - 29 = 1110240629 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1110247141) 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, 555120570 + 555120571.
It is an arithmetic number, because the mean of its divisors is an integer number (555120571).
Almost surely, 21110241141 is an apocalyptic number.
It is an amenable number.
1110241141 is a deficient number, since it is larger than the sum of its proper divisors (1).
1110241141 is an equidigital number, since it uses as much as digits as its factorization.
1110241141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 16.
The square root of 1110241141 is about 33320.2812263042. The cubic root of 1110241141 is about 1035.4737781287.
Adding to 1110241141 its reverse (1411420111), we get a palindrome (2521661252).
The spelling of 1110241141 in words is "one billion, one hundred ten million, two hundred forty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •