Base | Representation |
---|---|
bin | 11110001010011000111111… |
… | …111001111011011100111101 |
3 | 122101200201212010220022212222 |
4 | 132022120333321323130331 |
5 | 114341411311101221324 |
6 | 1150045021510335125 |
7 | 36641016161563253 |
oct | 3612307771733475 |
9 | 571621763808788 |
10 | 132655432054589 |
11 | 392a4942090674 |
12 | 12a6561795a4a5 |
13 | 5903479a2ab52 |
14 | 24a87b2c305d3 |
15 | 1050a13ad655e |
hex | 78a63fe7b73d |
132655432054589 has 2 divisors, whose sum is σ = 132655432054590. Its totient is φ = 132655432054588.
The previous prime is 132655432054517. The next prime is 132655432054597. The reversal of 132655432054589 is 985450234556231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 130687948925689 + 1967483128900 = 11431883^2 + 1402670^2 .
It is a cyclic number.
It is not a de Polignac number, because 132655432054589 - 28 = 132655432054333 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132655432044589) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66327716027294 + 66327716027295.
It is an arithmetic number, because the mean of its divisors is an integer number (66327716027295).
Almost surely, 2132655432054589 is an apocalyptic number.
It is an amenable number.
132655432054589 is a deficient number, since it is larger than the sum of its proper divisors (1).
132655432054589 is an equidigital number, since it uses as much as digits as its factorization.
132655432054589 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 155520000, while the sum is 62.
The spelling of 132655432054589 in words is "one hundred thirty-two trillion, six hundred fifty-five billion, four hundred thirty-two million, fifty-four thousand, five hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •