Base | Representation |
---|---|
bin | 11101010000000011111… |
… | …001100010100111111001 |
3 | 21010011110000210122220001 |
4 | 131100003321202213321 |
5 | 230413201142011301 |
6 | 4135233135433001 |
7 | 265140255011014 |
oct | 35200371424771 |
9 | 7104400718801 |
10 | 2010110110201 |
11 | 705534832266 |
12 | 2856a5985761 |
13 | 117724cc50bb |
14 | 6d40b4b637b |
15 | 3744a88ac01 |
hex | 1d403e629f9 |
2010110110201 has 4 divisors (see below), whose sum is σ = 2025937748992. Its totient is φ = 1994282471412.
The previous prime is 2010110110187. The next prime is 2010110110241. The reversal of 2010110110201 is 1020110110102.
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 2010110110201 - 237 = 1872671156729 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2010110110241) 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, 7913819205 + ... + 7913819458.
It is an arithmetic number, because the mean of its divisors is an integer number (506484437248).
Almost surely, 22010110110201 is an apocalyptic number.
It is an amenable number.
2010110110201 is a deficient number, since it is larger than the sum of its proper divisors (15827638791).
2010110110201 is a wasteful number, since it uses less digits than its factorization.
2010110110201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15827638790.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 2010110110201 its reverse (1020110110102), we get a palindrome (3030220220303).
Subtracting from 2010110110201 its reverse (1020110110102), we obtain a palindrome (990000000099).
The spelling of 2010110110201 in words is "two trillion, ten billion, one hundred ten million, one hundred ten thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •