Base | Representation |
---|---|
bin | 11101111010001001… |
… | …001110100000010101 |
3 | 10001220002011202002201 |
4 | 131322021032200111 |
5 | 1011232141311013 |
6 | 22430350404501 |
7 | 2214546403462 |
oct | 357211164025 |
9 | 101802152081 |
10 | 32114010133 |
11 | 1268a581147 |
12 | 6282b00731 |
13 | 304a349b7a |
14 | 17a9100669 |
15 | c7e50c3dd |
hex | 77a24e815 |
32114010133 has 2 divisors, whose sum is σ = 32114010134. Its totient is φ = 32114010132.
The previous prime is 32114010127. The next prime is 32114010161. The reversal of 32114010133 is 33101041123.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 31975877124 + 138133009 = 178818^2 + 11753^2 .
It is a cyclic number.
It is not a de Polignac number, because 32114010133 - 25 = 32114010101 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 32114010133.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (32114010113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16057005066 + 16057005067.
It is an arithmetic number, because the mean of its divisors is an integer number (16057005067).
Almost surely, 232114010133 is an apocalyptic number.
It is an amenable number.
32114010133 is a deficient number, since it is larger than the sum of its proper divisors (1).
32114010133 is an equidigital number, since it uses as much as digits as its factorization.
32114010133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 32114010133 its reverse (33101041123), we get a palindrome (65215051256).
The spelling of 32114010133 in words is "thirty-two billion, one hundred fourteen million, ten thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •