Base | Representation |
---|---|
bin | 10011110000010001… |
… | …100111111110100110 |
3 | 2000202020021112001121 |
4 | 103300101213332212 |
5 | 321420010134342 |
6 | 13424425444154 |
7 | 1350425464006 |
oct | 236021477646 |
9 | 60666245047 |
10 | 21211021222 |
11 | 8aa5083206 |
12 | 413b64065a |
13 | 200055a741 |
14 | 1053084006 |
15 | 842232067 |
hex | 4f0467fa6 |
21211021222 has 32 divisors (see below), whose sum is σ = 35170041600. Its totient is φ = 9549210528.
The previous prime is 21211021219. The next prime is 21211021229. The reversal of 21211021222 is 22212011212.
It is a happy number.
21211021222 is digitally balanced in base 5, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 21211021196 and 21211021205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21211021229) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 59929 + ... + 214507.
It is an arithmetic number, because the mean of its divisors is an integer number (1099063800).
Almost surely, 221211021222 is an apocalyptic number.
21211021222 is a deficient number, since it is larger than the sum of its proper divisors (13959020378).
21211021222 is a wasteful number, since it uses less digits than its factorization.
21211021222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 154780.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 21211021222 its reverse (22212011212), we get a palindrome (43423032434).
It can be divided in two parts, 212110 and 21222, that added together give a palindrome (233332).
The spelling of 21211021222 in words is "twenty-one billion, two hundred eleven million, twenty-one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •