Base | Representation |
---|---|
bin | 111101100011100101… |
… | …0111101100110111001 |
3 | 110122012120212011011122 |
4 | 1323013022331212321 |
5 | 4131211240334044 |
6 | 140421050235025 |
7 | 12356543131502 |
oct | 1730712754671 |
9 | 418176764148 |
10 | 132190558649 |
11 | 51075140286 |
12 | 21752425a75 |
13 | c60897b996 |
14 | 65803a9ba9 |
15 | 368a317dee |
hex | 1ec72bd9b9 |
132190558649 has 2 divisors, whose sum is σ = 132190558650. Its totient is φ = 132190558648.
The previous prime is 132190558631. The next prime is 132190558657. The reversal of 132190558649 is 946855091231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 126243064249 + 5947494400 = 355307^2 + 77120^2 .
It is a cyclic number.
It is not a de Polignac number, because 132190558649 - 232 = 127895591353 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 132190558649.
It is not a weakly prime, because it can be changed into another prime (132190558609) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66095279324 + 66095279325.
It is an arithmetic number, because the mean of its divisors is an integer number (66095279325).
Almost surely, 2132190558649 is an apocalyptic number.
It is an amenable number.
132190558649 is a deficient number, since it is larger than the sum of its proper divisors (1).
132190558649 is an equidigital number, since it uses as much as digits as its factorization.
132190558649 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2332800, while the sum is 53.
The spelling of 132190558649 in words is "one hundred thirty-two billion, one hundred ninety million, five hundred fifty-eight thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •