Base | Representation |
---|---|
bin | 1011101001111000001… |
… | …1011101010000100110 |
3 | 201010210200122002212212 |
4 | 2322132003131100212 |
5 | 11240022332431042 |
6 | 231551353443422 |
7 | 20315433431261 |
oct | 2723603352046 |
9 | 633720562785 |
10 | 200220202022 |
11 | 77a050a2245 |
12 | 32979410572 |
13 | 15b5ab2a829 |
14 | 9995441cd8 |
15 | 531c96e482 |
hex | 2e9e0dd426 |
200220202022 has 4 divisors (see below), whose sum is σ = 300330303036. Its totient is φ = 100110101010.
The previous prime is 200220202003. The next prime is 200220202043. The reversal of 200220202022 is 220202022002.
It is a happy number.
200220202022 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 220202022002 = 2 ⋅110101011001.
It is a junction number, because it is equal to n+sod(n) for n = 200220201988 and 200220202006.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50055050504 + ... + 50055050507.
It is an arithmetic number, because the mean of its divisors is an integer number (75082575759).
Almost surely, 2200220202022 is an apocalyptic number.
200220202022 is a deficient number, since it is larger than the sum of its proper divisors (100110101014).
200220202022 is a wasteful number, since it uses less digits than its factorization.
200220202022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100110101013.
The product of its (nonzero) digits is 128, while the sum is 14.
Adding to 200220202022 its reverse (220202022002), we get a palindrome (420422224024).
The spelling of 200220202022 in words is "two hundred billion, two hundred twenty million, two hundred two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •