Base | Representation |
---|---|
bin | 11110000101100000111001… |
… | …010101001111000000001101 |
3 | 122100111200212012202200202202 |
4 | 132011200321111033000031 |
5 | 114320414000431313312 |
6 | 1145231040242331245 |
7 | 36604553512061435 |
oct | 3605407125170015 |
9 | 570450765680682 |
10 | 132320314322957 |
11 | 39185803940872 |
12 | 12a10691659b25 |
13 | 58aa9a1496ca7 |
14 | 24964a1ad72c5 |
15 | 1046e4d38d9c2 |
hex | 78583954f00d |
132320314322957 has 2 divisors, whose sum is σ = 132320314322958. Its totient is φ = 132320314322956.
The previous prime is 132320314322953. The next prime is 132320314322969. The reversal of 132320314322957 is 759223413023231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 131931205349161 + 389108973796 = 11486131^2 + 623786^2 .
It is a cyclic number.
It is not a de Polignac number, because 132320314322957 - 22 = 132320314322953 is a prime.
It is a super-2 number, since 2×1323203143229572 (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 (132320314322953) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66160157161478 + 66160157161479.
It is an arithmetic number, because the mean of its divisors is an integer number (66160157161479).
Almost surely, 2132320314322957 is an apocalyptic number.
It is an amenable number.
132320314322957 is a deficient number, since it is larger than the sum of its proper divisors (1).
132320314322957 is an equidigital number, since it uses as much as digits as its factorization.
132320314322957 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1632960, while the sum is 47.
The spelling of 132320314322957 in words is "one hundred thirty-two trillion, three hundred twenty billion, three hundred fourteen million, three hundred twenty-two thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •