Base | Representation |
---|---|
bin | 111101111001111100… |
… | …0000111100111101001 |
3 | 110201010212011212202102 |
4 | 1323303320013213221 |
5 | 4134230242444031 |
6 | 141023322143145 |
7 | 12414251254442 |
oct | 1736370074751 |
9 | 421125155672 |
10 | 132940593641 |
11 | 5141a554709 |
12 | 21921651ab5 |
13 | c6c818937b |
14 | 6611c4a2c9 |
15 | 36d10c07cb |
hex | 1ef3e079e9 |
132940593641 has 2 divisors, whose sum is σ = 132940593642. Its totient is φ = 132940593640.
The previous prime is 132940593619. The next prime is 132940593647. The reversal of 132940593641 is 146395049231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 131989796416 + 950797225 = 363304^2 + 30835^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132940593641 is a prime.
It is not a weakly prime, because it can be changed into another prime (132940593647) 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, 66470296820 + 66470296821.
It is an arithmetic number, because the mean of its divisors is an integer number (66470296821).
Almost surely, 2132940593641 is an apocalyptic number.
It is an amenable number.
132940593641 is a deficient number, since it is larger than the sum of its proper divisors (1).
132940593641 is an equidigital number, since it uses as much as digits as its factorization.
132940593641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 699840, while the sum is 47.
The spelling of 132940593641 in words is "one hundred thirty-two billion, nine hundred forty million, five hundred ninety-three thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •