Base | Representation |
---|---|
bin | 111101110100100111… |
… | …1011100111000111001 |
3 | 110200200102102112202212 |
4 | 1323221033130320321 |
5 | 4133344103120242 |
6 | 140553505504505 |
7 | 12406653513665 |
oct | 1735117347071 |
9 | 420612375685 |
10 | 132762160697 |
11 | 51338862371 |
12 | 21891942135 |
13 | c69a21384a |
14 | 65d627d8a5 |
15 | 36c05c6782 |
hex | 1ee93dce39 |
132762160697 has 2 divisors, whose sum is σ = 132762160698. Its totient is φ = 132762160696.
The previous prime is 132762160589. The next prime is 132762160703. The reversal of 132762160697 is 796061267231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 66871891216 + 65890269481 = 258596^2 + 256691^2 .
It is an emirp because it is prime and its reverse (796061267231) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 132762160697 - 212 = 132762156601 is a prime.
It is not a weakly prime, because it can be changed into another prime (132762190697) 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, 66381080348 + 66381080349.
It is an arithmetic number, because the mean of its divisors is an integer number (66381080349).
Almost surely, 2132762160697 is an apocalyptic number.
It is an amenable number.
132762160697 is a deficient number, since it is larger than the sum of its proper divisors (1).
132762160697 is an equidigital number, since it uses as much as digits as its factorization.
132762160697 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1143072, while the sum is 50.
The spelling of 132762160697 in words is "one hundred thirty-two billion, seven hundred sixty-two million, one hundred sixty thousand, six hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.157 sec. • engine limits •