Base | Representation |
---|---|
bin | 11110000101101011111001… |
… | …000000011100001010010101 |
3 | 122100112211022222021211212212 |
4 | 132011223321000130022111 |
5 | 114321112140212010033 |
6 | 1145240311531523205 |
7 | 36605452203666065 |
oct | 3605537100341225 |
9 | 570484288254785 |
10 | 132332120031893 |
11 | 3918a811959711 |
12 | 12a12a272b9505 |
13 | 58abb332c2b92 |
14 | 2496ca19bb3a5 |
15 | 10473dea31748 |
hex | 785af901c295 |
132332120031893 has 2 divisors, whose sum is σ = 132332120031894. Its totient is φ = 132332120031892.
The previous prime is 132332120031883. The next prime is 132332120032031. The reversal of 132332120031893 is 398130021233231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 67330181017009 + 65001939014884 = 8205497^2 + 8062378^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132332120031893 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 132332120031893.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132332120031803) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66166060015946 + 66166060015947.
It is an arithmetic number, because the mean of its divisors is an integer number (66166060015947).
Almost surely, 2132332120031893 is an apocalyptic number.
It is an amenable number.
132332120031893 is a deficient number, since it is larger than the sum of its proper divisors (1).
132332120031893 is an equidigital number, since it uses as much as digits as its factorization.
132332120031893 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 139968, while the sum is 41.
The spelling of 132332120031893 in words is "one hundred thirty-two trillion, three hundred thirty-two billion, one hundred twenty million, thirty-one thousand, eight hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •