Base | Representation |
---|---|
bin | 10011101100011… |
… | …10100001100101 |
3 | 102111212112210210 |
4 | 21312032201211 |
5 | 314243211323 |
6 | 24221010033 |
7 | 4044156300 |
oct | 1166164145 |
9 | 374775723 |
10 | 165210213 |
11 | 85290973 |
12 | 473b3919 |
13 | 282c612c |
14 | 17d27b37 |
15 | e786293 |
hex | 9d8e865 |
165210213 has 12 divisors (see below), whose sum is σ = 256244640. Its totient is φ = 94405752.
The previous prime is 165210211. The next prime is 165210223. The reversal of 165210213 is 312012561.
165210213 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 165210213 - 21 = 165210211 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 165210213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (165210211) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 561793 + ... + 562086.
It is an arithmetic number, because the mean of its divisors is an integer number (21353720).
Almost surely, 2165210213 is an apocalyptic number.
It is an amenable number.
165210213 is a deficient number, since it is larger than the sum of its proper divisors (91034427).
165210213 is a wasteful number, since it uses less digits than its factorization.
165210213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1123896 (or 1123889 counting only the distinct ones).
The product of its (nonzero) digits is 360, while the sum is 21.
The square root of 165210213 is about 12853.4125040784. The cubic root of 165210213 is about 548.7134811721.
Adding to 165210213 its reverse (312012561), we get a palindrome (477222774).
The spelling of 165210213 in words is "one hundred sixty-five million, two hundred ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •