Base | Representation |
---|---|
bin | 111101100111100100… |
… | …1101111101000011101 |
3 | 110122112220210220011102 |
4 | 1323033021233220131 |
5 | 4132000030110424 |
6 | 140442232202445 |
7 | 12363060216614 |
oct | 1731711575035 |
9 | 418486726142 |
10 | 132324456989 |
11 | 5113378506a |
12 | 2178b239425 |
13 | c62a63097a |
14 | 65940a287b |
15 | 3696e667ae |
hex | 1ecf26fa1d |
132324456989 has 2 divisors, whose sum is σ = 132324456990. Its totient is φ = 132324456988.
The previous prime is 132324456937. The next prime is 132324456991. The reversal of 132324456989 is 989654423231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 132162785764 + 161671225 = 363542^2 + 12715^2 .
It is a cyclic number.
It is not a de Polignac number, because 132324456989 - 212 = 132324452893 is a prime.
It is a super-2 number, since 2×1323244569892 (a number of 23 digits) contains 22 as substring.
Together with 132324456991, 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 (132324456389) 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, 66162228494 + 66162228495.
It is an arithmetic number, because the mean of its divisors is an integer number (66162228495).
Almost surely, 2132324456989 is an apocalyptic number.
It is an amenable number.
132324456989 is a deficient number, since it is larger than the sum of its proper divisors (1).
132324456989 is an equidigital number, since it uses as much as digits as its factorization.
132324456989 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 11197440, while the sum is 56.
The spelling of 132324456989 in words is "one hundred thirty-two billion, three hundred twenty-four million, four hundred fifty-six thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •