Base | Representation |
---|---|
bin | 111101110100111000… |
… | …1101111110101000011 |
3 | 110200201001100022101101 |
4 | 1323221301233311003 |
5 | 4133403403314141 |
6 | 140554430315231 |
7 | 12410123110201 |
oct | 1735161576503 |
9 | 420631308341 |
10 | 132771151171 |
11 | 5134294300a |
12 | 21894958b17 |
13 | c69c040a59 |
14 | 65d7540071 |
15 | 36c12a0531 |
hex | 1ee9c6fd43 |
132771151171 has 2 divisors, whose sum is σ = 132771151172. Its totient is φ = 132771151170.
The previous prime is 132771151169. The next prime is 132771151187. The reversal of 132771151171 is 171151177231.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 132771151171 - 21 = 132771151169 is a prime.
Together with 132771151169, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 132771151171.
It is not a weakly prime, because it can be changed into another prime (132771151141) 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, 66385575585 + 66385575586.
It is an arithmetic number, because the mean of its divisors is an integer number (66385575586).
Almost surely, 2132771151171 is an apocalyptic number.
132771151171 is a deficient number, since it is larger than the sum of its proper divisors (1).
132771151171 is an equidigital number, since it uses as much as digits as its factorization.
132771151171 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 10290, while the sum is 37.
The spelling of 132771151171 in words is "one hundred thirty-two billion, seven hundred seventy-one million, one hundred fifty-one thousand, one hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •