Base | Representation |
---|---|
bin | 10011010100000… |
… | …01101111100101 |
3 | 102021212001212101 |
4 | 21222001233211 |
5 | 312433342013 |
6 | 24024252101 |
7 | 4005036403 |
oct | 1152015745 |
9 | 367761771 |
10 | 162012133 |
11 | 834a7128 |
12 | 46311031 |
13 | 2774658a |
14 | 17734473 |
15 | e3538dd |
hex | 9a81be5 |
162012133 has 2 divisors, whose sum is σ = 162012134. Its totient is φ = 162012132.
The previous prime is 162012083. The next prime is 162012139. The reversal of 162012133 is 331210261.
162012133 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 137874564 + 24137569 = 11742^2 + 4913^2 .
It is a cyclic number.
It is not a de Polignac number, because 162012133 - 29 = 162011621 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 162012133.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (162012139) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 81006066 + 81006067.
It is an arithmetic number, because the mean of its divisors is an integer number (81006067).
Almost surely, 2162012133 is an apocalyptic number.
It is an amenable number.
162012133 is a deficient number, since it is larger than the sum of its proper divisors (1).
162012133 is an equidigital number, since it uses as much as digits as its factorization.
162012133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 216, while the sum is 19.
The square root of 162012133 is about 12728.3986816881. The cubic root of 162012133 is about 545.1497868458.
Adding to 162012133 its reverse (331210261), we get a palindrome (493222394).
The spelling of 162012133 in words is "one hundred sixty-two million, twelve thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.151 sec. • engine limits •