Base | Representation |
---|---|
bin | 111101011110010011… |
… | …0000011100100100101 |
3 | 110121202012221220120022 |
4 | 1322330212003210211 |
5 | 4130330324032324 |
6 | 140351311044525 |
7 | 12352256635232 |
oct | 1727446034445 |
9 | 417665856508 |
10 | 132013111589 |
11 | 50a93a61717 |
12 | 21702b10745 |
13 | c5aac8cb18 |
14 | 65649b8789 |
15 | 367996605e |
hex | 1ebc983925 |
132013111589 has 2 divisors, whose sum is σ = 132013111590. Its totient is φ = 132013111588.
The previous prime is 132013111577. The next prime is 132013111591. The reversal of 132013111589 is 985111310231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 128314404100 + 3698707489 = 358210^2 + 60817^2 .
It is a cyclic number.
It is not a de Polignac number, because 132013111589 - 220 = 132012063013 is a prime.
It is a super-2 number, since 2×1320131115892 (a number of 23 digits) contains 22 as substring.
Together with 132013111591, 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 (132013111189) 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, 66006555794 + 66006555795.
It is an arithmetic number, because the mean of its divisors is an integer number (66006555795).
Almost surely, 2132013111589 is an apocalyptic number.
It is an amenable number.
132013111589 is a deficient number, since it is larger than the sum of its proper divisors (1).
132013111589 is an equidigital number, since it uses as much as digits as its factorization.
132013111589 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6480, while the sum is 35.
The spelling of 132013111589 in words is "one hundred thirty-two billion, thirteen million, one hundred eleven thousand, five hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •