Base | Representation |
---|---|
bin | 101111110011001000101011… |
… | …101011100001100111101001 |
3 | 1000120100001020201022112201122 |
4 | 233303020223223201213221 |
5 | 210023240032214201301 |
6 | 2023034425120425025 |
7 | 62165024066450204 |
oct | 5763105353414751 |
9 | 1016301221275648 |
10 | 210222202100201 |
11 | 60a8a80a671005 |
12 | 1b6b257a178175 |
13 | 903bb3a3c9765 |
14 | 39cab4778293b |
15 | 19485666a681b |
hex | bf322bae19e9 |
210222202100201 has 32 divisors (see below), whose sum is σ = 229039172812800. Its totient is φ = 192361712019840.
The previous prime is 210222202100161. The next prime is 210222202100227. The reversal of 210222202100201 is 102001202222012.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 210222202100201 - 230 = 210221128358377 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 210222202100201.
It is not an unprimeable number, because it can be changed into a prime (210222202100231) 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, 258435020 + ... + 259247186.
It is an arithmetic number, because the mean of its divisors is an integer number (7157474150400).
Almost surely, 2210222202100201 is an apocalyptic number.
It is an amenable number.
210222202100201 is a deficient number, since it is larger than the sum of its proper divisors (18816970712599).
210222202100201 is a wasteful number, since it uses less digits than its factorization.
210222202100201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 816389.
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 210222202100201 its reverse (102001202222012), we get a palindrome (312223404322213).
The spelling of 210222202100201 in words is "two hundred ten trillion, two hundred twenty-two billion, two hundred two million, one hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •