Base | Representation |
---|---|
bin | 11110000110000001101100… |
… | …111110010011001110101101 |
3 | 122100122001210011222002122212 |
4 | 132012001230332103032231 |
5 | 114322003121324331212 |
6 | 1145255143525020205 |
7 | 36610241451250634 |
oct | 3606015476231655 |
9 | 570561704862585 |
10 | 132355540464557 |
11 | 391997400aa393 |
12 | 12a17482854665 |
13 | 58b10c64c8967 |
14 | 249808426c51b |
15 | 1047d10bdde22 |
hex | 78606cf933ad |
132355540464557 has 2 divisors, whose sum is σ = 132355540464558. Its totient is φ = 132355540464556.
The previous prime is 132355540464523. The next prime is 132355540464571. The reversal of 132355540464557 is 755464045553231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 73120182469156 + 59235357995401 = 8551034^2 + 7696451^2 .
It is a cyclic number.
It is not a de Polignac number, because 132355540464557 - 234 = 132338360595373 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 132355540464496 and 132355540464505.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132355540466557) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66177770232278 + 66177770232279.
It is an arithmetic number, because the mean of its divisors is an integer number (66177770232279).
Almost surely, 2132355540464557 is an apocalyptic number.
It is an amenable number.
132355540464557 is a deficient number, since it is larger than the sum of its proper divisors (1).
132355540464557 is an equidigital number, since it uses as much as digits as its factorization.
132355540464557 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 151200000, while the sum is 59.
The spelling of 132355540464557 in words is "one hundred thirty-two trillion, three hundred fifty-five billion, five hundred forty million, four hundred sixty-four thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •