Base | Representation |
---|---|
bin | 1000100111000000… |
… | …1110110011000001 |
3 | 12222001210011112022 |
4 | 2021300032303001 |
5 | 14213121401423 |
6 | 1021155211225 |
7 | 111162133226 |
oct | 21160166301 |
9 | 5861704468 |
10 | 2311122113 |
11 | a86628283 |
12 | 545ba6b15 |
13 | 2aaa6a6a1 |
14 | 17cd2594d |
15 | d7d6bdc8 |
hex | 89c0ecc1 |
2311122113 has 8 divisors (see below), whose sum is σ = 2322777600. Its totient is φ = 2299483648.
The previous prime is 2311122091. The next prime is 2311122127. The reversal of 2311122113 is 3112211132.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2311122113 - 26 = 2311122049 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2311122091 and 2311122100.
It is not an unprimeable number, because it can be changed into a prime (2311122193) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 333320 + ... + 340182.
It is an arithmetic number, because the mean of its divisors is an integer number (290347200).
Almost surely, 22311122113 is an apocalyptic number.
It is an amenable number.
2311122113 is a deficient number, since it is larger than the sum of its proper divisors (11655487).
2311122113 is a wasteful number, since it uses less digits than its factorization.
2311122113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8511.
The product of its digits is 72, while the sum is 17.
The square root of 2311122113 is about 48074.1314326114. The cubic root of 2311122113 is about 1322.1304197515.
Adding to 2311122113 its reverse (3112211132), we get a palindrome (5423333245).
The spelling of 2311122113 in words is "two billion, three hundred eleven million, one hundred twenty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •