Base | Representation |
---|---|
bin | 100001101111100… |
… | …1101000101110101 |
3 | 2220220112102212221 |
4 | 1003133031011311 |
5 | 4304324103212 |
6 | 304204042341 |
7 | 40025665531 |
oct | 10337150565 |
9 | 2826472787 |
10 | 1132253557 |
11 | 531144946 |
12 | 2772333b1 |
13 | 150764626 |
14 | aa536bc1 |
15 | 69607807 |
hex | 437cd175 |
1132253557 has 2 divisors, whose sum is σ = 1132253558. Its totient is φ = 1132253556.
The previous prime is 1132253537. The next prime is 1132253561. The reversal of 1132253557 is 7553522311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 765684241 + 366569316 = 27671^2 + 19146^2 .
It is an emirp because it is prime and its reverse (7553522311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1132253557 - 223 = 1123864949 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1132253537) 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, 566126778 + 566126779.
It is an arithmetic number, because the mean of its divisors is an integer number (566126779).
Almost surely, 21132253557 is an apocalyptic number.
It is an amenable number.
1132253557 is a deficient number, since it is larger than the sum of its proper divisors (1).
1132253557 is an equidigital number, since it uses as much as digits as its factorization.
1132253557 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 31500, while the sum is 34.
The square root of 1132253557 is about 33648.9755713305. The cubic root of 1132253557 is about 1042.2723848678.
Adding to 1132253557 its reverse (7553522311), we get a palindrome (8685775868).
The spelling of 1132253557 in words is "one billion, one hundred thirty-two million, two hundred fifty-three thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •