Base | Representation |
---|---|
bin | 111110111110110… |
… | …0110111001101001 |
3 | 12110021112212111221 |
4 | 1331331212321221 |
5 | 13312001131441 |
6 | 545411222041 |
7 | 103240525450 |
oct | 17575467151 |
9 | 5407485457 |
10 | 2113302121 |
11 | 9949a4187 |
12 | 4ab8a7921 |
13 | 278a97738 |
14 | 16094db97 |
15 | c57e38d1 |
hex | 7df66e69 |
2113302121 has 4 divisors (see below), whose sum is σ = 2415202432. Its totient is φ = 1811401812.
The previous prime is 2113302089. The next prime is 2113302167. The reversal of 2113302121 is 1212033112.
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 2113302121 - 25 = 2113302089 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2113302095 and 2113302104.
It is not an unprimeable number, because it can be changed into a prime (2113302421) 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, 150950145 + ... + 150950158.
It is an arithmetic number, because the mean of its divisors is an integer number (603800608).
Almost surely, 22113302121 is an apocalyptic number.
It is an amenable number.
2113302121 is a deficient number, since it is larger than the sum of its proper divisors (301900311).
2113302121 is an equidigital number, since it uses as much as digits as its factorization.
2113302121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 301900310.
The product of its (nonzero) digits is 72, while the sum is 16.
The square root of 2113302121 is about 45970.6658750991. The cubic root of 2113302121 is about 1283.2773519329.
Adding to 2113302121 its reverse (1212033112), we get a palindrome (3325335233).
The spelling of 2113302121 in words is "two billion, one hundred thirteen million, three hundred two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •