Base | Representation |
---|---|
bin | 1110100110100111010110… |
… | …00111011111000111101101 |
3 | 11012200222120112222202101221 |
4 | 13103103223013133013231 |
5 | 13202120132222110013 |
6 | 152144321432503341 |
7 | 6523045024112413 |
oct | 723235307370755 |
9 | 135628515882357 |
10 | 32113120113133 |
11 | a261109131144 |
12 | 37278a2b4ab51 |
13 | 14bc33c71b2b7 |
14 | 7d03d75712b3 |
15 | 3aa508c6c08d |
hex | 1d34eb1df1ed |
32113120113133 has 2 divisors, whose sum is σ = 32113120113134. Its totient is φ = 32113120113132.
The previous prime is 32113120113119. The next prime is 32113120113161. The reversal of 32113120113133 is 33131102131123.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 32109652905444 + 3467207689 = 5666538^2 + 58883^2 .
It is a cyclic number.
It is not a de Polignac number, because 32113120113133 - 237 = 31975681159661 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 32113120113098 and 32113120113107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (32113120113233) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16056560056566 + 16056560056567.
It is an arithmetic number, because the mean of its divisors is an integer number (16056560056567).
Almost surely, 232113120113133 is an apocalyptic number.
It is an amenable number.
32113120113133 is a deficient number, since it is larger than the sum of its proper divisors (1).
32113120113133 is an equidigital number, since it uses as much as digits as its factorization.
32113120113133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 972, while the sum is 25.
Adding to 32113120113133 its reverse (33131102131123), we get a palindrome (65244222244256).
The spelling of 32113120113133 in words is "thirty-two trillion, one hundred thirteen billion, one hundred twenty million, one hundred thirteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •