Base | Representation |
---|---|
bin | 1001000110101110010000… |
… | …01100001101110001110110 |
3 | 2121220002210121221221010200 |
4 | 10203113020030031301312 |
5 | 10111020432002241042 |
6 | 110330023335101330 |
7 | 4134361545143352 |
oct | 443271014156166 |
9 | 77802717857120 |
10 | 20022201212022 |
11 | 641a405674249 |
12 | 22b452a811846 |
13 | b23115a25899 |
14 | 4d3118a18462 |
15 | 24ac53eacc4c |
hex | 1235c830dc76 |
20022201212022 has 24 divisors (see below), whose sum is σ = 43382281846176. Its totient is φ = 6673936934256.
The previous prime is 20022201211997. The next prime is 20022201212051. The reversal of 20022201212022 is 22021210222002.
It is a super-3 number, since 3×200222012120223 (a number of 41 digits) contains 333 as substring.
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 = 20022201211986 and 20022201212004.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 9893673 + ... + 11744324.
It is an arithmetic number, because the mean of its divisors is an integer number (1807595076924).
Almost surely, 220022201212022 is an apocalyptic number.
20022201212022 is an abundant number, since it is smaller than the sum of its proper divisors (23360080634154).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20022201212022 is a wasteful number, since it uses less digits than its factorization.
20022201212022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21689412 (or 21689409 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 18.
Adding to 20022201212022 its reverse (22021210222002), we get a palindrome (42043411434024).
The spelling of 20022201212022 in words is "twenty trillion, twenty-two billion, two hundred one million, two hundred twelve thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •