Base | Representation |
---|---|
bin | 111101101000011010… |
… | …1000111010000101101 |
3 | 110122121212202212110222 |
4 | 1323100311013100231 |
5 | 4132024231300211 |
6 | 140445115341125 |
7 | 12363551364521 |
oct | 1732065072055 |
9 | 418555685428 |
10 | 132352603181 |
11 | 51148659787 |
12 | 217987517a5 |
13 | c633406c16 |
14 | 6597b0bd81 |
15 | 36996761db |
hex | 1ed0d4742d |
132352603181 has 2 divisors, whose sum is σ = 132352603182. Its totient is φ = 132352603180.
The previous prime is 132352603099. The next prime is 132352603183. The reversal of 132352603181 is 181306253231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 112918849156 + 19433754025 = 336034^2 + 139405^2 .
It is a cyclic number.
It is not a de Polignac number, because 132352603181 - 222 = 132348408877 is a prime.
It is a super-2 number, since 2×1323526031812 (a number of 23 digits) contains 22 as substring.
Together with 132352603183, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132352603183) 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, 66176301590 + 66176301591.
It is an arithmetic number, because the mean of its divisors is an integer number (66176301591).
Almost surely, 2132352603181 is an apocalyptic number.
It is an amenable number.
132352603181 is a deficient number, since it is larger than the sum of its proper divisors (1).
132352603181 is an equidigital number, since it uses as much as digits as its factorization.
132352603181 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 25920, while the sum is 35.
The spelling of 132352603181 in words is "one hundred thirty-two billion, three hundred fifty-two million, six hundred three thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •