Base | Representation |
---|---|
bin | 111101101101011100… |
… | …0001001100000010001 |
3 | 110200001121222000000002 |
4 | 1323122320021200101 |
5 | 4132400404432321 |
6 | 140513540335345 |
7 | 12400666240004 |
oct | 1733270114021 |
9 | 420047860002 |
10 | 132521170961 |
11 | 512248231a3 |
12 | 218250a4555 |
13 | c65c30737a |
14 | 65b226b53b |
15 | 36a937220b |
hex | 1edae09811 |
132521170961 has 2 divisors, whose sum is σ = 132521170962. Its totient is φ = 132521170960.
The previous prime is 132521170939. The next prime is 132521171021. The reversal of 132521170961 is 169071125231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 111526609936 + 20994561025 = 333956^2 + 144895^2 .
It is an emirp because it is prime and its reverse (169071125231) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132521170961 is a prime.
It is not a weakly prime, because it can be changed into another prime (132521172961) 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, 66260585480 + 66260585481.
It is an arithmetic number, because the mean of its divisors is an integer number (66260585481).
Almost surely, 2132521170961 is an apocalyptic number.
It is an amenable number.
132521170961 is a deficient number, since it is larger than the sum of its proper divisors (1).
132521170961 is an equidigital number, since it uses as much as digits as its factorization.
132521170961 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 22680, while the sum is 38.
The spelling of 132521170961 in words is "one hundred thirty-two billion, five hundred twenty-one million, one hundred seventy thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •