Base | Representation |
---|---|
bin | 1001101001101001011101… |
… | …11100110101101111001110 |
3 | 2210010211021002002222022111 |
4 | 10310310232330311233032 |
5 | 10240201102101011342 |
6 | 113045204230134234 |
7 | 4320153265032556 |
oct | 464645674655716 |
9 | 83124232088274 |
10 | 21222221110222 |
11 | 6842325611130 |
12 | 2469012ab137a |
13 | bac329489572 |
14 | 535237a42166 |
15 | 26c08a7c9217 |
hex | 134d2ef35bce |
21222221110222 has 32 divisors (see below), whose sum is σ = 35312339865600. Its totient is φ = 9484086290400.
The previous prime is 21222221110171. The next prime is 21222221110229. The reversal of 21222221110222 is 22201112222212.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a junction number, because it is equal to n+sod(n) for n = 21222221110193 and 21222221110202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21222221110229) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 526722 + ... + 6536197.
It is an arithmetic number, because the mean of its divisors is an integer number (1103510620800).
Almost surely, 221222221110222 is an apocalyptic number.
21222221110222 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
21222221110222 is a deficient number, since it is larger than the sum of its proper divisors (14090118755378).
21222221110222 is a wasteful number, since it uses less digits than its factorization.
21222221110222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7065232.
The product of its (nonzero) digits is 512, while the sum is 22.
Adding to 21222221110222 its reverse (22201112222212), we get a palindrome (43423333332434).
The spelling of 21222221110222 in words is "twenty-one trillion, two hundred twenty-two billion, two hundred twenty-one million, one hundred ten thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •