Base | Representation |
---|---|
bin | 111110111100100… |
… | …0110100111011111 |
3 | 12110012022212202020 |
4 | 1331321012213133 |
5 | 13311200340221 |
6 | 545330031223 |
7 | 103224510036 |
oct | 17571064737 |
9 | 5405285666 |
10 | 2112121311 |
11 | 994268003 |
12 | 4ab418513 |
13 | 278773131 |
14 | 16072371d |
15 | c565dac6 |
hex | 7de469df |
2112121311 has 8 divisors (see below), whose sum is σ = 2833025664. Its totient is φ = 1399648920.
The previous prime is 2112121309. The next prime is 2112121313. The reversal of 2112121311 is 1131212112.
It is an interprime number because it is at equal distance from previous prime (2112121309) and next prime (2112121313).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2112121311 - 21 = 2112121309 is a prime.
It is a super-2 number, since 2×21121213112 = 8922112864760717442, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2112121313) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2107405 + ... + 2108406.
It is an arithmetic number, because the mean of its divisors is an integer number (354128208).
Almost surely, 22112121311 is an apocalyptic number.
2112121311 is a deficient number, since it is larger than the sum of its proper divisors (720904353).
2112121311 is a wasteful number, since it uses less digits than its factorization.
2112121311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4215981.
The product of its digits is 24, while the sum is 15.
The square root of 2112121311 is about 45957.8209992597. The cubic root of 2112121311 is about 1283.0382965026.
Adding to 2112121311 its reverse (1131212112), we get a palindrome (3243333423).
The spelling of 2112121311 in words is "two billion, one hundred twelve million, one hundred twenty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •