Base | Representation |
---|---|
bin | 10011010100001… |
… | …00001000110101 |
3 | 102021212120022122 |
4 | 21222010020311 |
5 | 312434200231 |
6 | 24024405325 |
7 | 4005110114 |
oct | 1152041065 |
9 | 367776278 |
10 | 162021941 |
11 | 83503534 |
12 | 46316845 |
13 | 2774ab93 |
14 | 17737c7b |
15 | e35677b |
hex | 9a84235 |
162021941 has 2 divisors, whose sum is σ = 162021942. Its totient is φ = 162021940.
The previous prime is 162021889. The next prime is 162021953. The reversal of 162021941 is 149120261.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 107039716 + 54982225 = 10346^2 + 7415^2 .
It is a cyclic number.
It is not a de Polignac number, because 162021941 - 210 = 162020917 is a prime.
It is a super-2 number, since 2×1620219412 = 52502218730814962, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 162021941.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (162021961) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 81010970 + 81010971.
It is an arithmetic number, because the mean of its divisors is an integer number (81010971).
Almost surely, 2162021941 is an apocalyptic number.
It is an amenable number.
162021941 is a deficient number, since it is larger than the sum of its proper divisors (1).
162021941 is an equidigital number, since it uses as much as digits as its factorization.
162021941 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 26.
The square root of 162021941 is about 12728.7839560580. The cubic root of 162021941 is about 545.1607875059.
The spelling of 162021941 in words is "one hundred sixty-two million, twenty-one thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •