Base | Representation |
---|---|
bin | 11110001100101010111100… |
… | …010101111111000001010101 |
3 | 122102020201100021220222200121 |
4 | 132030222330111333001111 |
5 | 114401443224440403202 |
6 | 1150245015411511541 |
7 | 36655234414363435 |
oct | 3614527425770125 |
9 | 572221307828617 |
10 | 132812138606677 |
11 | 39355347924652 |
12 | 12a8ba705b85b1 |
13 | 591519186a80a |
14 | 24b21db1922c5 |
15 | 1054b36367537 |
hex | 78cabc57f055 |
132812138606677 has 2 divisors, whose sum is σ = 132812138606678. Its totient is φ = 132812138606676.
The previous prime is 132812138606647. The next prime is 132812138606689. The reversal of 132812138606677 is 776606831218231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 123936541717041 + 8875596889636 = 11132679^2 + 2979194^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132812138606677 is a prime.
It is a super-2 number, since 2×1328121386066772 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132812138606647) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66406069303338 + 66406069303339.
It is an arithmetic number, because the mean of its divisors is an integer number (66406069303339).
Almost surely, 2132812138606677 is an apocalyptic number.
It is an amenable number.
132812138606677 is a deficient number, since it is larger than the sum of its proper divisors (1).
132812138606677 is an equidigital number, since it uses as much as digits as its factorization.
132812138606677 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 24385536, while the sum is 61.
The spelling of 132812138606677 in words is "one hundred thirty-two trillion, eight hundred twelve billion, one hundred thirty-eight million, six hundred six thousand, six hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •