Base | Representation |
---|---|
bin | 111101100100110110… |
… | …1011001101011011101 |
3 | 110122022112222120010011 |
4 | 1323021231121223131 |
5 | 4131303141002312 |
6 | 140425211043221 |
7 | 12360601103251 |
oct | 1731155315335 |
9 | 418275876104 |
10 | 132233140957 |
11 | 51097184a75 |
12 | 21764740511 |
13 | c61473aa08 |
14 | 6585cd2261 |
15 | 368de29da7 |
hex | 1ec9b59add |
132233140957 has 2 divisors, whose sum is σ = 132233140958. Its totient is φ = 132233140956.
The previous prime is 132233140927. The next prime is 132233140997. The reversal of 132233140957 is 759041332231.
It is a happy number.
It is an a-pointer prime, because the next prime (132233140997) can be obtained adding 132233140957 to its sum of digits (40).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 131492539161 + 740601796 = 362619^2 + 27214^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132233140957 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132233140927) 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, 66116570478 + 66116570479.
It is an arithmetic number, because the mean of its divisors is an integer number (66116570479).
Almost surely, 2132233140957 is an apocalyptic number.
It is an amenable number.
132233140957 is a deficient number, since it is larger than the sum of its proper divisors (1).
132233140957 is an equidigital number, since it uses as much as digits as its factorization.
132233140957 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 136080, while the sum is 40.
The spelling of 132233140957 in words is "one hundred thirty-two billion, two hundred thirty-three million, one hundred forty thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •