Base | Representation |
---|---|
bin | 11101010000000011111… |
… | …001111000100011001101 |
3 | 21010011110000222020002102 |
4 | 131100003321320203031 |
5 | 230413201202400023 |
6 | 4135233141404445 |
7 | 265140255533606 |
oct | 35200371704315 |
9 | 7104400866072 |
10 | 2010110200013 |
11 | 705534893793 |
12 | 2856a5a09725 |
13 | 117725026c46 |
14 | 6d40b4dadad |
15 | 3744a8a7628 |
hex | 1d403e788cd |
2010110200013 has 4 divisors (see below), whose sum is σ = 2044179864480. Its totient is φ = 1976040535548.
The previous prime is 2010110200003. The next prime is 2010110200051. The reversal of 2010110200013 is 3100020110102.
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 2010110200013 - 24 = 2010110199997 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2010110199967 and 2010110200003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2010110200003) 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, 17034832145 + ... + 17034832262.
It is an arithmetic number, because the mean of its divisors is an integer number (511044966120).
Almost surely, 22010110200013 is an apocalyptic number.
It is an amenable number.
2010110200013 is a deficient number, since it is larger than the sum of its proper divisors (34069664467).
2010110200013 is an equidigital number, since it uses as much as digits as its factorization.
2010110200013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34069664466.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 2010110200013 its reverse (3100020110102), we get a palindrome (5110130310115).
The spelling of 2010110200013 in words is "two trillion, ten billion, one hundred ten million, two hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •