Base | Representation |
---|---|
bin | 1001000110001000101010… |
… | …11010101101110001001110 |
3 | 2121211011201022020212200200 |
4 | 10203010111122231301032 |
5 | 10110203120114202342 |
6 | 110312445125034330 |
7 | 4133045515644252 |
oct | 443042532556116 |
9 | 77734638225620 |
10 | 20002022022222 |
11 | 641189aa86289 |
12 | 22b06388559a6 |
13 | b2124b19baa6 |
14 | 4d2162a0a262 |
15 | 24a47264894c |
hex | 1231156adc4e |
20002022022222 has 48 divisors (see below), whose sum is σ = 44835522732000. Its totient is φ = 6436943537472.
The previous prime is 20002022022139. The next prime is 20002022022233. The reversal of 20002022022222 is 22222022020002.
20002022022222 is a `hidden beast` number, since 200 + 0 + 2 + 0 + 220 + 22 + 222 = 666.
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 = 20002022022195 and 20002022022204.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5457279 + ... + 8353797.
It is an arithmetic number, because the mean of its divisors is an integer number (934073390250).
Almost surely, 220002022022222 is an apocalyptic number.
20002022022222 is an abundant number, since it is smaller than the sum of its proper divisors (24833500709778).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20002022022222 is a wasteful number, since it uses less digits than its factorization.
20002022022222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2909785 (or 2909782 counting only the distinct ones).
The product of its (nonzero) digits is 512, while the sum is 18.
Adding to 20002022022222 its reverse (22222022020002), we get a palindrome (42224044042224).
The spelling of 20002022022222 in words is "twenty trillion, two billion, twenty-two million, twenty-two thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •