Base | Representation |
---|---|
bin | 1111101111001… |
… | …01111011010101 |
3 | 100012101222212022 |
4 | 13313211323111 |
5 | 232243420111 |
6 | 21033302525 |
7 | 3162045554 |
oct | 767457325 |
9 | 305358768 |
10 | 132013781 |
11 | 685779a9 |
12 | 38264a45 |
13 | 21472283 |
14 | 13765d9b |
15 | b8ca2db |
hex | 7de5ed5 |
132013781 has 2 divisors, whose sum is σ = 132013782. Its totient is φ = 132013780.
The previous prime is 132013759. The next prime is 132013793. The reversal of 132013781 is 187310231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 117831025 + 14182756 = 10855^2 + 3766^2 .
It is a cyclic number.
It is not a de Polignac number, because 132013781 - 218 = 131751637 is a prime.
It is a super-2 number, since 2×1320137812 = 34855276747831922, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 132013781.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132013081) 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, 66006890 + 66006891.
It is an arithmetic number, because the mean of its divisors is an integer number (66006891).
Almost surely, 2132013781 is an apocalyptic number.
It is an amenable number.
132013781 is a deficient number, since it is larger than the sum of its proper divisors (1).
132013781 is an equidigital number, since it uses as much as digits as its factorization.
132013781 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1008, while the sum is 26.
The square root of 132013781 is about 11489.7250184676. The cubic root of 132013781 is about 509.1820555254.
The spelling of 132013781 in words is "one hundred thirty-two million, thirteen thousand, seven hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •