Base | Representation |
---|---|
bin | 111101100001111001… |
… | …1101111111001010001 |
3 | 110122001122200212102101 |
4 | 1323003303233321101 |
5 | 4131102320012041 |
6 | 140411313120401 |
7 | 12355256446204 |
oct | 1730363577121 |
9 | 418048625371 |
10 | 132134141521 |
11 | 51046307258 |
12 | 21737559101 |
13 | c5ca087775 |
14 | 6576ac193b |
15 | 36853c1b31 |
hex | 1ec3cefe51 |
132134141521 has 2 divisors, whose sum is σ = 132134141522. Its totient is φ = 132134141520.
The previous prime is 132134141501. The next prime is 132134141543. The reversal of 132134141521 is 125141431231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 119777595921 + 12356545600 = 346089^2 + 111160^2 .
It is a cyclic number.
It is not a de Polignac number, because 132134141521 - 225 = 132100587089 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 132134141521.
It is not a weakly prime, because it can be changed into another prime (132134141501) 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, 66067070760 + 66067070761.
It is an arithmetic number, because the mean of its divisors is an integer number (66067070761).
Almost surely, 2132134141521 is an apocalyptic number.
It is an amenable number.
132134141521 is a deficient number, since it is larger than the sum of its proper divisors (1).
132134141521 is an equidigital number, since it uses as much as digits as its factorization.
132134141521 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2880, while the sum is 28.
Adding to 132134141521 its reverse (125141431231), we get a palindrome (257275572752).
The spelling of 132134141521 in words is "one hundred thirty-two billion, one hundred thirty-four million, one hundred forty-one thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •