Base | Representation |
---|---|
bin | 111101100111110011… |
… | …0111100000011010101 |
3 | 110122120110012201011122 |
4 | 1323033212330003111 |
5 | 4132004010010122 |
6 | 140443104213325 |
7 | 12363212242661 |
oct | 1731746740325 |
9 | 418513181148 |
10 | 132332110037 |
11 | 511380319a6 |
12 | 2179190a245 |
13 | c62c0b01ba |
14 | 65950d58a1 |
15 | 3697979142 |
hex | 1ecf9bc0d5 |
132332110037 has 2 divisors, whose sum is σ = 132332110038. Its totient is φ = 132332110036.
The previous prime is 132332110013. The next prime is 132332110051. The reversal of 132332110037 is 730011233231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 77278996081 + 55053113956 = 277991^2 + 234634^2 .
It is a cyclic number.
It is not a de Polignac number, because 132332110037 - 228 = 132063674581 is a prime.
It is a super-2 number, since 2×1323321100372 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 132332109988 and 132332110015.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132332110087) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66166055018 + 66166055019.
It is an arithmetic number, because the mean of its divisors is an integer number (66166055019).
Almost surely, 2132332110037 is an apocalyptic number.
It is an amenable number.
132332110037 is a deficient number, since it is larger than the sum of its proper divisors (1).
132332110037 is an equidigital number, since it uses as much as digits as its factorization.
132332110037 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2268, while the sum is 26.
Adding to 132332110037 its reverse (730011233231), we get a palindrome (862343343268).
The spelling of 132332110037 in words is "one hundred thirty-two billion, three hundred thirty-two million, one hundred ten thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •