Base | Representation |
---|---|
bin | 101111110000001100100011… |
… | …011011011011110000000110 |
3 | 1000112121201211212002212002121 |
4 | 233300030203123123300012 |
5 | 210011432332222414342 |
6 | 2022401540435000154 |
7 | 62144313226602055 |
oct | 5760144333336006 |
9 | 1015551755085077 |
10 | 210020200201222 |
11 | 60a12080886544 |
12 | 1b67b3a413905a |
13 | 9025a87419a98 |
14 | 39c106387039c |
15 | 19431925e7067 |
hex | bf03236dbc06 |
210020200201222 has 16 divisors (see below), whose sum is σ = 322357034284560. Its totient is φ = 102567862226592.
The previous prime is 210020200201213. The next prime is 210020200201237. The reversal of 210020200201222 is 222102002020012.
210020200201222 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2100202002012222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 210020200201196 and 210020200201205.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 87905968 + ... + 90263500.
It is an arithmetic number, because the mean of its divisors is an integer number (20147314642785).
Almost surely, 2210020200201222 is an apocalyptic number.
210020200201222 is a deficient number, since it is larger than the sum of its proper divisors (112336834083338).
210020200201222 is a wasteful number, since it uses less digits than its factorization.
210020200201222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3393447.
The product of its (nonzero) digits is 128, while the sum is 16.
Adding to 210020200201222 its reverse (222102002020012), we get a palindrome (432122202221234).
The spelling of 210020200201222 in words is "two hundred ten trillion, twenty billion, two hundred million, two hundred one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •