Base | Representation |
---|---|
bin | 111101110000110010… |
… | …1001001101000100111 |
3 | 110200100110120120112202 |
4 | 1323201211021220213 |
5 | 4133113202200041 |
6 | 140533035005115 |
7 | 12403533156431 |
oct | 1734145115047 |
9 | 420313516482 |
10 | 132633631271 |
11 | 512822552a9 |
12 | 2185689979b |
13 | c6796c152b |
14 | 65c3183651 |
15 | 36b4188a9b |
hex | 1ee1949a27 |
132633631271 has 2 divisors, whose sum is σ = 132633631272. Its totient is φ = 132633631270.
The previous prime is 132633631267. The next prime is 132633631301. The reversal of 132633631271 is 172136336231.
It is a weak prime.
It is an emirp because it is prime and its reverse (172136336231) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 132633631271 - 22 = 132633631267 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132633631241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66316815635 + 66316815636.
It is an arithmetic number, because the mean of its divisors is an integer number (66316815636).
Almost surely, 2132633631271 is an apocalyptic number.
132633631271 is a deficient number, since it is larger than the sum of its proper divisors (1).
132633631271 is an equidigital number, since it uses as much as digits as its factorization.
132633631271 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 81648, while the sum is 38.
The spelling of 132633631271 in words is "one hundred thirty-two billion, six hundred thirty-three million, six hundred thirty-one thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •