Base | Representation |
---|---|
bin | 11101010000001001111… |
… | …010011110110011110110 |
3 | 21010011201001200102010211 |
4 | 131100021322132303312 |
5 | 230413403010120042 |
6 | 4135251142340034 |
7 | 265142621512522 |
oct | 35201172366366 |
9 | 7104631612124 |
10 | 2010211020022 |
11 | 705586795307 |
12 | 28571372a61a |
13 | 11773cb96a5a |
14 | 6d41aa62d82 |
15 | 37454670017 |
hex | 1d409e9ecf6 |
2010211020022 has 4 divisors (see below), whose sum is σ = 3015316530036. Its totient is φ = 1005105510010.
The previous prime is 2010211019863. The next prime is 2010211020029. The reversal of 2010211020022 is 2200201120102.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a junction number, because it is equal to n+sod(n) for n = 2010211019984 and 2010211020011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2010211020029) 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 as a sum of consecutive naturals, namely, 502552755004 + ... + 502552755007.
It is an arithmetic number, because the mean of its divisors is an integer number (753829132509).
Almost surely, 22010211020022 is an apocalyptic number.
2010211020022 is a deficient number, since it is larger than the sum of its proper divisors (1005105510014).
2010211020022 is a wasteful number, since it uses less digits than its factorization.
2010211020022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1005105510013.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 2010211020022 its reverse (2200201120102), we get a palindrome (4210412140124).
The spelling of 2010211020022 in words is "two trillion, ten billion, two hundred eleven million, twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •