Base | Representation |
---|---|
bin | 11110101101010001101… |
… | …110100011010100011001 |
3 | 21110201210110202222002202 |
4 | 132231101232203110121 |
5 | 234033142211200441 |
6 | 4253225035335545 |
7 | 305312503620551 |
oct | 36552156432431 |
9 | 7421713688082 |
10 | 2110200100121 |
11 | 743a26a420a3 |
12 | 2a0b798b15b5 |
13 | 123cb6351cc9 |
14 | 741c4480161 |
15 | 39d5794e19b |
hex | 1eb51ba3519 |
2110200100121 has 4 divisors (see below), whose sum is σ = 2110944967092. Its totient is φ = 2109455233152.
The previous prime is 2110200100117. The next prime is 2110200100123. The reversal of 2110200100121 is 1210010020112.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 379302015625 + 1730898084496 = 615875^2 + 1315636^2 .
It is a cyclic number.
It is not a de Polignac number, because 2110200100121 - 22 = 2110200100117 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (2110200100123) 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, 372429236 + ... + 372434901.
It is an arithmetic number, because the mean of its divisors is an integer number (527736241773).
Almost surely, 22110200100121 is an apocalyptic number.
It is an amenable number.
2110200100121 is a deficient number, since it is larger than the sum of its proper divisors (744866971).
2110200100121 is an equidigital number, since it uses as much as digits as its factorization.
2110200100121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 744866970.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 2110200100121 its reverse (1210010020112), we get a palindrome (3320210120233).
The spelling of 2110200100121 in words is "two trillion, one hundred ten billion, two hundred million, one hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •