Base | Representation |
---|---|
bin | 100010000001010… |
… | …0100101010110001 |
3 | 2221112222111010222 |
4 | 1010002210222301 |
5 | 4314212301134 |
6 | 305134502425 |
7 | 40200542501 |
oct | 10402445261 |
9 | 2845874128 |
10 | 1141525169 |
11 | 5363a7834 |
12 | 27a364a15 |
13 | 15265c7a5 |
14 | ab86ba01 |
15 | 6a339a2e |
hex | 440a4ab1 |
1141525169 has 2 divisors, whose sum is σ = 1141525170. Its totient is φ = 1141525168.
The previous prime is 1141525141. The next prime is 1141525193. The reversal of 1141525169 is 9615251411.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1139737600 + 1787569 = 33760^2 + 1337^2 .
It is an emirp because it is prime and its reverse (9615251411) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1141525169 - 220 = 1140476593 is a prime.
It is a super-2 number, since 2×11415251692 = 2606159422920957122, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1141525109) 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, 570762584 + 570762585.
It is an arithmetic number, because the mean of its divisors is an integer number (570762585).
Almost surely, 21141525169 is an apocalyptic number.
It is an amenable number.
1141525169 is a deficient number, since it is larger than the sum of its proper divisors (1).
1141525169 is an equidigital number, since it uses as much as digits as its factorization.
1141525169 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 10800, while the sum is 35.
The square root of 1141525169 is about 33786.4642867525. The cubic root of 1141525169 is about 1045.1095842895.
The spelling of 1141525169 in words is "one billion, one hundred forty-one million, five hundred twenty-five thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •