Base | Representation |
---|---|
bin | 100001110000001… |
… | …0110010101011001 |
3 | 2220221002200102012 |
4 | 1003200112111121 |
5 | 4304413203221 |
6 | 304214315305 |
7 | 40031355266 |
oct | 10340262531 |
9 | 2827080365 |
10 | 1132553561 |
11 | 53132a287 |
12 | 277358b35 |
13 | 15083b049 |
14 | aa5b426d |
15 | 6966665b |
hex | 43816559 |
1132553561 has 2 divisors, whose sum is σ = 1132553562. Its totient is φ = 1132553560.
The previous prime is 1132553531. The next prime is 1132553563. The reversal of 1132553561 is 1653552311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 717168400 + 415385161 = 26780^2 + 20381^2 .
It is a cyclic number.
It is not a de Polignac number, because 1132553561 - 226 = 1065444697 is a prime.
Together with 1132553563, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (1132553563) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 566276780 + 566276781.
It is an arithmetic number, because the mean of its divisors is an integer number (566276781).
Almost surely, 21132553561 is an apocalyptic number.
It is an amenable number.
1132553561 is a deficient number, since it is larger than the sum of its proper divisors (1).
1132553561 is an equidigital number, since it uses as much as digits as its factorization.
1132553561 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 13500, while the sum is 32.
The square root of 1132553561 is about 33653.4331235314. The cubic root of 1132553561 is about 1042.3644308794.
The spelling of 1132553561 in words is "one billion, one hundred thirty-two million, five hundred fifty-three thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •