Base | Representation |
---|---|
bin | 100001110011001… |
… | …1001111011100101 |
3 | 2221001002100012001 |
4 | 1003212121323211 |
5 | 4310320004112 |
6 | 304312325301 |
7 | 40051016662 |
oct | 10346317345 |
9 | 2831070161 |
10 | 1134141157 |
11 | 532214046 |
12 | 2779a3831 |
13 | 150c75856 |
14 | aa8a8a69 |
15 | 6987bc57 |
hex | 43999ee5 |
1134141157 has 2 divisors, whose sum is σ = 1134141158. Its totient is φ = 1134141156.
The previous prime is 1134141091. The next prime is 1134141163. The reversal of 1134141157 is 7511414311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 745617636 + 388523521 = 27306^2 + 19711^2 .
It is an emirp because it is prime and its reverse (7511414311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1134141157 - 211 = 1134139109 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1134148157) 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, 567070578 + 567070579.
It is an arithmetic number, because the mean of its divisors is an integer number (567070579).
Almost surely, 21134141157 is an apocalyptic number.
It is an amenable number.
1134141157 is a deficient number, since it is larger than the sum of its proper divisors (1).
1134141157 is an equidigital number, since it uses as much as digits as its factorization.
1134141157 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1680, while the sum is 28.
The square root of 1134141157 is about 33677.0122932543. The cubic root of 1134141157 is about 1042.8512602327.
Adding to 1134141157 its reverse (7511414311), we get a palindrome (8645555468).
The spelling of 1134141157 in words is "one billion, one hundred thirty-four million, one hundred forty-one thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •