Base | Representation |
---|---|
bin | 1111101111100… |
… | …01111100000101 |
3 | 100012111111100112 |
4 | 13313301330011 |
5 | 232302003411 |
6 | 21034322405 |
7 | 3162342161 |
oct | 767617405 |
9 | 305444315 |
10 | 132062981 |
11 | 68600966 |
12 | 38289405 |
13 | 2148b79b |
14 | 13779ca1 |
15 | b8d9b8b |
hex | 7df1f05 |
132062981 has 2 divisors, whose sum is σ = 132062982. Its totient is φ = 132062980.
The previous prime is 132062971. The next prime is 132062989. The reversal of 132062981 is 189260231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 120780100 + 11282881 = 10990^2 + 3359^2 .
It is an emirp because it is prime and its reverse (189260231) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 132062981 - 214 = 132046597 is a prime.
It is a super-2 number, since 2×1320629812 = 34881261901212722, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132062989) 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, 66031490 + 66031491.
It is an arithmetic number, because the mean of its divisors is an integer number (66031491).
Almost surely, 2132062981 is an apocalyptic number.
It is an amenable number.
132062981 is a deficient number, since it is larger than the sum of its proper divisors (1).
132062981 is an equidigital number, since it uses as much as digits as its factorization.
132062981 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 32.
The square root of 132062981 is about 11491.8658624263. The cubic root of 132062981 is about 509.2453030779.
The spelling of 132062981 in words is "one hundred thirty-two million, sixty-two thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •