Base | Representation |
---|---|
bin | 101101110000001010101100… |
… | …011001010000100100010100 |
3 | 222101110122102211102122120001 |
4 | 231300022230121100210110 |
5 | 202333310340142321322 |
6 | 1551544054454421044 |
7 | 60245550321041446 |
oct | 5560125431204424 |
9 | 871418384378501 |
10 | 201222110120212 |
11 | 5912a8aa349a65 |
12 | 1a69a239661784 |
13 | 883821847384c |
14 | 37992b8796496 |
15 | 183e3aedab827 |
hex | b702ac650914 |
201222110120212 has 72 divisors (see below), whose sum is σ = 380334889519200. Its totient is φ = 93088281367872.
The previous prime is 201222110120173. The next prime is 201222110120237. The reversal of 201222110120212 is 212021011222102.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a self number, because there is not a number n which added to its sum of digits gives 201222110120212.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 547405614 + ... + 547773082.
It is an arithmetic number, because the mean of its divisors is an integer number (5282429021100).
Almost surely, 2201222110120212 is an apocalyptic number.
It is an amenable number.
201222110120212 is a deficient number, since it is larger than the sum of its proper divisors (179112779398988).
201222110120212 is a wasteful number, since it uses less digits than its factorization.
201222110120212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 376373 (or 376352 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 201222110120212 its reverse (212021011222102), we get a palindrome (413243121342314).
The spelling of 201222110120212 in words is "two hundred one trillion, two hundred twenty-two billion, one hundred ten million, one hundred twenty thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •