Base | Representation |
---|---|
bin | 1111110000001… |
… | …10001110100001 |
3 | 100012122201100022 |
4 | 13320012032201 |
5 | 232312133311 |
6 | 21040203225 |
7 | 3163136354 |
oct | 770061641 |
9 | 305581308 |
10 | 132146081 |
11 | 68658341 |
12 | 38309515 |
13 | 214ba562 |
14 | 1379c29b |
15 | b9045db |
hex | 7e063a1 |
132146081 has 2 divisors, whose sum is σ = 132146082. Its totient is φ = 132146080.
The previous prime is 132146051. The next prime is 132146099. The reversal of 132146081 is 180641231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 127803025 + 4343056 = 11305^2 + 2084^2 .
It is a cyclic number.
It is not a de Polignac number, because 132146081 - 218 = 131883937 is a prime.
It is a super-2 number, since 2×1321460812 = 34925173447317122, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 132146081.
It is not a weakly prime, because it can be changed into another prime (132146051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66073040 + 66073041.
It is an arithmetic number, because the mean of its divisors is an integer number (66073041).
Almost surely, 2132146081 is an apocalyptic number.
It is an amenable number.
132146081 is a deficient number, since it is larger than the sum of its proper divisors (1).
132146081 is an equidigital number, since it uses as much as digits as its factorization.
132146081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 26.
The square root of 132146081 is about 11495.4808946820. The cubic root of 132146081 is about 509.3520940733.
The spelling of 132146081 in words is "one hundred thirty-two million, one hundred forty-six thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •