Base | Representation |
---|---|
bin | 1001000110101110010010… |
… | …11000000101101111000110 |
3 | 2121220002212000101110002100 |
4 | 10203113021120011233012 |
5 | 10111021002100231042 |
6 | 110330025325252530 |
7 | 4134362206203606 |
oct | 443271130055706 |
9 | 77802760343070 |
10 | 20022221102022 |
11 | 641a415919967 |
12 | 22b4535404146 |
13 | b23119b9ac09 |
14 | 4d311b514c06 |
15 | 24ac55adb24c |
hex | 1235c9605bc6 |
20022221102022 has 24 divisors (see below), whose sum is σ = 43381564246800. Its totient is φ = 6674060594160.
The previous prime is 20022221101997. The next prime is 20022221102029. The reversal of 20022221102022 is 22020112222002.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 20022221101986 and 20022221102004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20022221102029) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 13862247 + ... + 15238317.
It is an arithmetic number, because the mean of its divisors is an integer number (1807565176950).
Almost surely, 220022221102022 is an apocalyptic number.
20022221102022 is an abundant number, since it is smaller than the sum of its proper divisors (23359343144778).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20022221102022 is a wasteful number, since it uses less digits than its factorization.
20022221102022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2184428 (or 2184425 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 18.
Adding to 20022221102022 its reverse (22020112222002), we get a palindrome (42042333324024).
The spelling of 20022221102022 in words is "twenty trillion, twenty-two billion, two hundred twenty-one million, one hundred two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •