Base | Representation |
---|---|
bin | 1001101001101001011011… |
… | …10100000001000100011001 |
3 | 2210010211012202012002121201 |
4 | 10310310231310001010121 |
5 | 10240201032204120441 |
6 | 113045202305034201 |
7 | 4320152643543364 |
oct | 464645564010431 |
9 | 83124182162551 |
10 | 21222202020121 |
11 | 6842315862493 |
12 | 2469008625961 |
13 | bac32553434b |
14 | 5352352b30db |
15 | 26c088ca7c31 |
hex | 134d2dd01119 |
21222202020121 has 16 divisors (see below), whose sum is σ = 23653431172800. Its totient is φ = 18922420274688.
The previous prime is 21222202020119. The next prime is 21222202020139. The reversal of 21222202020121 is 12102020222212.
It is a cyclic number.
It is not a de Polignac number, because 21222202020121 - 21 = 21222202020119 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21222202020101) 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, 52993125 + ... + 53392093.
It is an arithmetic number, because the mean of its divisors is an integer number (1478339448300).
Almost surely, 221222202020121 is an apocalyptic number.
It is an amenable number.
21222202020121 is a deficient number, since it is larger than the sum of its proper divisors (2431229152679).
21222202020121 is a wasteful number, since it uses less digits than its factorization.
21222202020121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 563688.
The product of its (nonzero) digits is 256, while the sum is 19.
Adding to 21222202020121 its reverse (12102020222212), we get a palindrome (33324222242333).
The spelling of 21222202020121 in words is "twenty-one trillion, two hundred twenty-two billion, two hundred two million, twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •