Base | Representation |
---|---|
bin | 11101010001000111011… |
… | …011111111010100100001 |
3 | 21010021100222221022020121 |
4 | 131101013123333110201 |
5 | 230423011230322423 |
6 | 4135541414040241 |
7 | 265210324150660 |
oct | 35210733772441 |
9 | 7107328838217 |
10 | 2011243214113 |
11 | 705a663a7a81 |
12 | 285961349081 |
13 | 1178759967a3 |
14 | 6d4b7b90dd7 |
15 | 374b50b045d |
hex | 1d4476ff521 |
2011243214113 has 4 divisors (see below), whose sum is σ = 2298563673280. Its totient is φ = 1723922754948.
The previous prime is 2011243214093. The next prime is 2011243214143. The reversal of 2011243214113 is 3114123421102.
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 2011243214113 - 213 = 2011243205921 is a prime.
It is not an unprimeable number, because it can be changed into a prime (2011243214143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 143660229573 + ... + 143660229586.
It is an arithmetic number, because the mean of its divisors is an integer number (574640918320).
Almost surely, 22011243214113 is an apocalyptic number.
It is an amenable number.
2011243214113 is a deficient number, since it is larger than the sum of its proper divisors (287320459167).
2011243214113 is an equidigital number, since it uses as much as digits as its factorization.
2011243214113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 287320459166.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 2011243214113 its reverse (3114123421102), we get a palindrome (5125366635215).
The spelling of 2011243214113 in words is "two trillion, eleven billion, two hundred forty-three million, two hundred fourteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •