Base | Representation |
---|---|
bin | 111110111110011… |
… | …1000000001101001 |
3 | 12110021012010010211 |
4 | 1331330320001221 |
5 | 13311424010441 |
6 | 545403141121 |
7 | 103236065623 |
oct | 17574700151 |
9 | 5407163124 |
10 | 2113110121 |
11 | 994882a01 |
12 | 4ab8147a1 |
13 | 278a2b225 |
14 | 1608ddc13 |
15 | c57a6a81 |
hex | 7df38069 |
2113110121 has 4 divisors (see below), whose sum is σ = 2115121744. Its totient is φ = 2111098500.
The previous prime is 2113110107. The next prime is 2113110127. The reversal of 2113110121 is 1210113112.
It is a happy number.
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 2113110121 - 215 = 2113077353 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2113110127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1004235 + ... + 1006336.
It is an arithmetic number, because the mean of its divisors is an integer number (528780436).
Almost surely, 22113110121 is an apocalyptic number.
It is an amenable number.
2113110121 is a deficient number, since it is larger than the sum of its proper divisors (2011623).
2113110121 is a wasteful number, since it uses less digits than its factorization.
2113110121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2011622.
The product of its (nonzero) digits is 12, while the sum is 13.
The square root of 2113110121 is about 45968.5775394454. The cubic root of 2113110121 is about 1283.2384875240.
Adding to 2113110121 its reverse (1210113112), we get a palindrome (3323223233).
The spelling of 2113110121 in words is "two billion, one hundred thirteen million, one hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •