Base | Representation |
---|---|
bin | 11101000110110110011… |
… | …001110001011011100110 |
3 | 21002012220202211010000010 |
4 | 131012312121301123212 |
5 | 230232422310031042 |
6 | 4130515520231050 |
7 | 264340213330254 |
oct | 35066631613346 |
9 | 7065822733003 |
10 | 2000220002022 |
11 | 70131a055640 |
12 | 2837a576b486 |
13 | 11680a002998 |
14 | 6cb4db9b5d4 |
15 | 3706c48859c |
hex | 1d1b66716e6 |
2000220002022 has 64 divisors (see below), whose sum is σ = 4524355906560. Its totient is φ = 583962086400.
The previous prime is 2000220002021. The next prime is 2000220002029. The reversal of 2000220002022 is 2202000220002.
It is a junction number, because it is equal to n+sod(n) for n = 2000220001989 and 2000220002007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2000220002021) 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 31 ways as a sum of consecutive naturals, for example, 242379 + ... + 2014742.
It is an arithmetic number, because the mean of its divisors is an integer number (70693061040).
Almost surely, 22000220002022 is an apocalyptic number.
2000220002022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
2000220002022 is an abundant number, since it is smaller than the sum of its proper divisors (2524135904538).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2000220002022 is a wasteful number, since it uses less digits than its factorization.
2000220002022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2257629.
The product of its (nonzero) digits is 64, while the sum is 12.
Adding to 2000220002022 its reverse (2202000220002), we get a palindrome (4202220222024).
The spelling of 2000220002022 in words is "two trillion, two hundred twenty million, two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •