Base | Representation |
---|---|
bin | 100010000001000… |
… | …1011110000100101 |
3 | 2221112210022012011 |
4 | 1010002023300211 |
5 | 4314201020031 |
6 | 305132354221 |
7 | 40166636155 |
oct | 10402136045 |
9 | 2845708164 |
10 | 1141423141 |
11 | 536338111 |
12 | 27a315971 |
13 | 152625211 |
14 | ab842765 |
15 | 6a3196b1 |
hex | 4408bc25 |
1141423141 has 2 divisors, whose sum is σ = 1141423142. Its totient is φ = 1141423140.
The previous prime is 1141423117. The next prime is 1141423159. The reversal of 1141423141 is 1413241411.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 860190241 + 281232900 = 29329^2 + 16770^2 .
It is an emirp because it is prime and its reverse (1413241411) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1141423141 - 219 = 1140898853 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1141429141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 570711570 + 570711571.
It is an arithmetic number, because the mean of its divisors is an integer number (570711571).
Almost surely, 21141423141 is an apocalyptic number.
It is an amenable number.
1141423141 is a deficient number, since it is larger than the sum of its proper divisors (1).
1141423141 is an equidigital number, since it uses as much as digits as its factorization.
1141423141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 384, while the sum is 22.
The square root of 1141423141 is about 33784.9543584123. The cubic root of 1141423141 is about 1045.0784465274.
Adding to 1141423141 its reverse (1413241411), we get a palindrome (2554664552).
The spelling of 1141423141 in words is "one billion, one hundred forty-one million, four hundred twenty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •