Base | Representation |
---|---|
bin | 11000000100011… |
… | …01011111110010 |
3 | 112001220220012000 |
4 | 30002031133302 |
5 | 403141444122 |
6 | 32011314430 |
7 | 5001113463 |
oct | 1402153762 |
9 | 461826160 |
10 | 201906162 |
11 | a3a750a7 |
12 | 5774ba16 |
13 | 32aa3b03 |
14 | 1cb5ad6a |
15 | 12ad40ac |
hex | c08d7f2 |
201906162 has 64 divisors (see below), whose sum is σ = 468049920. Its totient is φ = 64443600.
The previous prime is 201906143. The next prime is 201906163. The reversal of 201906162 is 261609102.
201906162 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (201906163) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 171837 + ... + 173007.
It is an arithmetic number, because the mean of its divisors is an integer number (7313280).
Almost surely, 2201906162 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 201906162, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (234024960).
201906162 is an abundant number, since it is smaller than the sum of its proper divisors (266143758).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201906162 is a wasteful number, since it uses less digits than its factorization.
201906162 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1316 (or 1310 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 27.
The square root of 201906162 is about 14209.3688107530. The cubic root of 201906162 is about 586.6555601519.
The spelling of 201906162 in words is "two hundred one million, nine hundred six thousand, one hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •