Base | Representation |
---|---|
bin | 11101010000000100000… |
… | …001111111001000101101 |
3 | 21010011110011222010211211 |
4 | 131100010001333020231 |
5 | 230413202223333031 |
6 | 4135233255114421 |
7 | 265140312561445 |
oct | 35200401771055 |
9 | 7104404863754 |
10 | 2010112324141 |
11 | 705536004669 |
12 | 2856a6672a11 |
13 | 1177255bba1c |
14 | 6d40b8d1125 |
15 | 3744ab76bb1 |
hex | 1d40407f22d |
2010112324141 has 4 divisors (see below), whose sum is σ = 2010605849532. Its totient is φ = 2009618798752.
The previous prime is 2010112324133. The next prime is 2010112324163. The reversal of 2010112324141 is 1414232110102.
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 584903744100 + 1425208580041 = 764790^2 + 1193821^2 .
It is a cyclic number.
It is not a de Polignac number, because 2010112324141 - 23 = 2010112324133 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2010112304141) 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, 246756586 + ... + 246764731.
It is an arithmetic number, because the mean of its divisors is an integer number (502651462383).
Almost surely, 22010112324141 is an apocalyptic number.
It is an amenable number.
2010112324141 is a deficient number, since it is larger than the sum of its proper divisors (493525391).
2010112324141 is an equidigital number, since it uses as much as digits as its factorization.
2010112324141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 493525390.
The product of its (nonzero) digits is 384, while the sum is 22.
Adding to 2010112324141 its reverse (1414232110102), we get a palindrome (3424344434243).
The spelling of 2010112324141 in words is "two trillion, ten billion, one hundred twelve million, three hundred twenty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •