Base | Representation |
---|---|
bin | 111100010000111… |
… | …0010001000011011 |
3 | 12012220222102220211 |
4 | 1320201302020123 |
5 | 13120130401021 |
6 | 532353031551 |
7 | 101052516310 |
oct | 17041621033 |
9 | 5186872824 |
10 | 2022122011 |
11 | 948487218 |
12 | 4852555b7 |
13 | 262c21600 |
14 | 1527b6d07 |
15 | bc7d23e1 |
hex | 7887221b |
2022122011 has 12 divisors (see below), whose sum is σ = 2502441552. Its totient is φ = 1599919776.
The previous prime is 2022121993. The next prime is 2022122017. The reversal of 2022122011 is 1102212202.
It is a happy number.
It is not a de Polignac number, because 2022122011 - 25 = 2022121979 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a junction number, because it is equal to n+sod(n) for n = 2022121982 and 2022122000.
It is not an unprimeable number, because it can be changed into a prime (2022122017) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 853476 + ... + 855841.
It is an arithmetic number, because the mean of its divisors is an integer number (208536796).
Almost surely, 22022122011 is an apocalyptic number.
2022122011 is a deficient number, since it is larger than the sum of its proper divisors (480319541).
2022122011 is a wasteful number, since it uses less digits than its factorization.
2022122011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1709350 (or 1709337 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
The square root of 2022122011 is about 44968.0109744694. The cubic root of 2022122011 is about 1264.5493582487.
Adding to 2022122011 its reverse (1102212202), we get a palindrome (3124334213).
It can be divided in two parts, 202212201 and 1, that added together give a palindrome (202212202).
The spelling of 2022122011 in words is "two billion, twenty-two million, one hundred twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •