Base | Representation |
---|---|
bin | 11101001111111101011… |
… | …101100011011010101001 |
3 | 21010011011111120200122002 |
4 | 131033331131203122221 |
5 | 230412441020010441 |
6 | 4135214320540345 |
7 | 265134504015665 |
oct | 35177535433251 |
9 | 7104144520562 |
10 | 2010002110121 |
11 | 7054898771a5 |
12 | 2856757816b5 |
13 | 117708810125 |
14 | 6d3db0018a5 |
15 | 37441155b9b |
hex | 1d3fd7636a9 |
2010002110121 has 4 divisors (see below), whose sum is σ = 2052768112512. Its totient is φ = 1967236107732.
The previous prime is 2010002110037. The next prime is 2010002110187. The reversal of 2010002110121 is 1210112000102.
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 2010002110121 - 218 = 2010001847977 is a prime.
It is a super-2 number, since 2×20100021101212 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2010002110321) 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, 21383001125 + ... + 21383001218.
It is an arithmetic number, because the mean of its divisors is an integer number (513192028128).
Almost surely, 22010002110121 is an apocalyptic number.
It is an amenable number.
2010002110121 is a deficient number, since it is larger than the sum of its proper divisors (42766002391).
2010002110121 is an equidigital number, since it uses as much as digits as its factorization.
2010002110121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 42766002390.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 2010002110121 its reverse (1210112000102), we get a palindrome (3220114110223).
The spelling of 2010002110121 in words is "two trillion, ten billion, two million, one hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •