Base | Representation |
---|---|
bin | 1001100110101011010000… |
… | …00100011111011000100110 |
3 | 2202210001200002121022222020 |
4 | 10303111220010133120212 |
5 | 10232012431122431042 |
6 | 112530235020444010 |
7 | 4306606525446333 |
oct | 463255004373046 |
9 | 82701602538866 |
10 | 21120100202022 |
11 | 6802a90a67338 |
12 | 24512729a9606 |
13 | ba280344b373 |
14 | 53030b05198a |
15 | 2695b02973ec |
hex | 13356811f626 |
21120100202022 has 8 divisors (see below), whose sum is σ = 42240200404056. Its totient is φ = 7040033400672.
The previous prime is 21120100202017. The next prime is 21120100202023. The reversal of 21120100202022 is 22020200102112.
It is a sphenic number, since it is the product of 3 distinct primes.
21120100202022 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 21120100201992 and 21120100202010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21120100202023) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1760008350163 + ... + 1760008350174.
It is an arithmetic number, because the mean of its divisors is an integer number (5280025050507).
Almost surely, 221120100202022 is an apocalyptic number.
21120100202022 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21120100202022 is a wasteful number, since it uses less digits than its factorization.
21120100202022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3520016700342.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 21120100202022 its reverse (22020200102112), we get a palindrome (43140300304134).
The spelling of 21120100202022 in words is "twenty-one trillion, one hundred twenty billion, one hundred million, two hundred two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •