Base | Representation |
---|---|
bin | 11110000101010001001011… |
… | …001110000010011000111101 |
3 | 122100110002021211111201221102 |
4 | 132011101023032002120331 |
5 | 114320124413221310424 |
6 | 1145215205254342445 |
7 | 36603415305324653 |
oct | 3605211316023075 |
9 | 570402254451842 |
10 | 132303434556989 |
11 | 39179631733863 |
12 | 12a0936065aa25 |
13 | 58a92113801a7 |
14 | 249573dd94dd3 |
15 | 10467b15167ae |
hex | 78544b38263d |
132303434556989 has 2 divisors, whose sum is σ = 132303434556990. Its totient is φ = 132303434556988.
The previous prime is 132303434556973. The next prime is 132303434557013. The reversal of 132303434556989 is 989655434303231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 123386730929764 + 8916703627225 = 11107958^2 + 2986085^2 .
It is a cyclic number.
It is not a de Polignac number, because 132303434556989 - 24 = 132303434556973 is a prime.
It is a super-2 number, since 2×1323034345569892 (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 (132303434556959) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66151717278494 + 66151717278495.
It is an arithmetic number, because the mean of its divisors is an integer number (66151717278495).
Almost surely, 2132303434556989 is an apocalyptic number.
It is an amenable number.
132303434556989 is a deficient number, since it is larger than the sum of its proper divisors (1).
132303434556989 is an equidigital number, since it uses as much as digits as its factorization.
132303434556989 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 251942400, while the sum is 65.
The spelling of 132303434556989 in words is "one hundred thirty-two trillion, three hundred three billion, four hundred thirty-four million, five hundred fifty-six thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •