Base | Representation |
---|---|
bin | 111111001111011… |
… | …0101000110001011 |
3 | 12110212221022212201 |
4 | 1332132311012023 |
5 | 13321213323034 |
6 | 550322021031 |
7 | 103404540022 |
oct | 17636650613 |
9 | 5425838781 |
10 | 2122011019 |
11 | 999902317 |
12 | 4b27a7777 |
13 | 27a82672b |
14 | 161b798b9 |
15 | c6464014 |
hex | 7e7b518b |
2122011019 has 8 divisors (see below), whose sum is σ = 2146760000. Its totient is φ = 2097358272.
The previous prime is 2122010993. The next prime is 2122011049. The reversal of 2122011019 is 9101102212.
It is a happy number.
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 2122011019 - 25 = 2122010987 is a prime.
It is a super-2 number, since 2×21220110192 = 9005861529514836722, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2122010987 and 2122011005.
It is not an unprimeable number, because it can be changed into a prime (2122011049) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20782 + ... + 68380.
It is an arithmetic number, because the mean of its divisors is an integer number (268345000).
Almost surely, 22122011019 is an apocalyptic number.
2122011019 is a deficient number, since it is larger than the sum of its proper divisors (24748981).
2122011019 is a wasteful number, since it uses less digits than its factorization.
2122011019 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48117.
The product of its (nonzero) digits is 72, while the sum is 19.
The square root of 2122011019 is about 46065.2908272595. The cubic root of 2122011019 is about 1285.0377272455.
The spelling of 2122011019 in words is "two billion, one hundred twenty-two million, eleven thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •