Base | Representation |
---|---|
bin | 11101010000001010011… |
… | …100101111101011011011 |
3 | 21010011201200120202010002 |
4 | 131100022130233223123 |
5 | 230413412310031021 |
6 | 4135252103043215 |
7 | 265143061042214 |
oct | 35201234575333 |
9 | 7104650522102 |
10 | 2010220002011 |
11 | 70559086a641 |
12 | 28571674050b |
13 | 1177419c0140 |
14 | 6d41bd2040b |
15 | 3745534650b |
hex | 1d40a72fadb |
2010220002011 has 4 divisors (see below), whose sum is σ = 2164852309872. Its totient is φ = 1855587694152.
The previous prime is 2010220001897. The next prime is 2010220002029. The reversal of 2010220002011 is 1102000220102.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2010220002011 - 222 = 2010215807707 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2010220001983 and 2010220002001.
It is not an unprimeable number, because it can be changed into a prime (2010220002911) 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 3 ways as a sum of consecutive naturals, for example, 77316153911 + ... + 77316153936.
It is an arithmetic number, because the mean of its divisors is an integer number (541213077468).
Almost surely, 22010220002011 is an apocalyptic number.
2010220002011 is a deficient number, since it is larger than the sum of its proper divisors (154632307861).
2010220002011 is a wasteful number, since it uses less digits than its factorization.
2010220002011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 154632307860.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 2010220002011 its reverse (1102000220102), we get a palindrome (3112220222113).
The spelling of 2010220002011 in words is "two trillion, ten billion, two hundred twenty million, two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •