Base | Representation |
---|---|
bin | 1001000110101100001101… |
… | …00011111000011111010110 |
3 | 2121212222221220001122212111 |
4 | 10203112012203320133112 |
5 | 10111011203112320042 |
6 | 110325322202541234 |
7 | 4134322345051531 |
oct | 443260643703726 |
9 | 77788856048774 |
10 | 20021100120022 |
11 | 64199a0083561 |
12 | 22b4281b0781a |
13 | b22c9b881b61 |
14 | 4d30526b3a18 |
15 | 24abdc4ad517 |
hex | 1235868f87d6 |
20021100120022 has 32 divisors (see below), whose sum is σ = 33379436385792. Its totient is φ = 8958090835584.
The previous prime is 20021100120019. The next prime is 20021100120023. The reversal of 20021100120022 is 22002100112002.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 20021100119984 and 20021100120011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20021100120023) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 76523388 + ... + 76784575.
It is an arithmetic number, because the mean of its divisors is an integer number (1043107387056).
Almost surely, 220021100120022 is an apocalyptic number.
20021100120022 is a deficient number, since it is larger than the sum of its proper divisors (13358336265770).
20021100120022 is a wasteful number, since it uses less digits than its factorization.
20021100120022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 153308172.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 20021100120022 its reverse (22002100112002), we get a palindrome (42023200232024).
The spelling of 20021100120022 in words is "twenty trillion, twenty-one billion, one hundred million, one hundred twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •