Base | Representation |
---|---|
bin | 1001101001100111100110… |
… | …11010011000000011110110 |
3 | 2210010201200110112002120011 |
4 | 10310303303122120003312 |
5 | 10240142030342020042 |
6 | 113044521144330434 |
7 | 4320116445433336 |
oct | 464636332300366 |
9 | 83121613462504 |
10 | 21221222220022 |
11 | 6841962786140 |
12 | 2468994473a1a |
13 | bac1ca54a586 |
14 | 5351811030c6 |
15 | 26c02cc66a17 |
hex | 134cf36980f6 |
21221222220022 has 16 divisors (see below), whose sum is σ = 34734854875392. Its totient is φ = 9643449401320.
The previous prime is 21221222219983. The next prime is 21221222220053. The reversal of 21221222220022 is 22002222212212.
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 = 21221222219975 and 21221222220002.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 127950178 + ... + 128115925.
It is an arithmetic number, because the mean of its divisors is an integer number (2170928429712).
Almost surely, 221221222220022 is an apocalyptic number.
21221222220022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
21221222220022 is a deficient number, since it is larger than the sum of its proper divisors (13513632655370).
21221222220022 is a wasteful number, since it uses less digits than its factorization.
21221222220022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 256069883.
The product of its (nonzero) digits is 1024, while the sum is 22.
Adding to 21221222220022 its reverse (22002222212212), we get a palindrome (43223444432234).
The spelling of 21221222220022 in words is "twenty-one trillion, two hundred twenty-one billion, two hundred twenty-two million, two hundred twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •