Base | Representation |
---|---|
bin | 11101001111111110100… |
… | …010001011101110011101 |
3 | 21010011012202102201111201 |
4 | 131033332202023232131 |
5 | 230413010121213041 |
6 | 4135220202315501 |
7 | 265135112646412 |
oct | 35177642135635 |
9 | 7104182381451 |
10 | 2010020101021 |
11 | 705498a45009 |
12 | 28567b7b8b91 |
13 | 11770c46bc2a |
14 | 6d3dd566109 |
15 | 37442a0b631 |
hex | 1d3fe88bb9d |
2010020101021 has 4 divisors (see below), whose sum is σ = 2011663618272. Its totient is φ = 2008376583772.
The previous prime is 2010020101009. The next prime is 2010020101049. The reversal of 2010020101021 is 1201010200102.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2010020101021 - 215 = 2010020068253 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2010020100989 and 2010020101007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2010020101081) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 821756791 + ... + 821759236.
It is an arithmetic number, because the mean of its divisors is an integer number (502915904568).
Almost surely, 22010020101021 is an apocalyptic number.
It is an amenable number.
2010020101021 is a deficient number, since it is larger than the sum of its proper divisors (1643517251).
2010020101021 is a wasteful number, since it uses less digits than its factorization.
2010020101021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1643517250.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 2010020101021 its reverse (1201010200102), we get a palindrome (3211030301123).
The spelling of 2010020101021 in words is "two trillion, ten billion, twenty million, one hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •