Base | Representation |
---|---|
bin | 111100010000101… |
… | …1010001111110101 |
3 | 12012220210110201111 |
4 | 1320201122033311 |
5 | 13120114233211 |
6 | 532350555021 |
7 | 101051631142 |
oct | 17041321765 |
9 | 5186713644 |
10 | 2022024181 |
11 | 94841a771 |
12 | 485208a71 |
13 | 262bb8c18 |
14 | 15278d3c9 |
15 | bc7b3421 |
hex | 7885a3f5 |
2022024181 has 2 divisors, whose sum is σ = 2022024182. Its totient is φ = 2022024180.
The previous prime is 2022024163. The next prime is 2022024187. The reversal of 2022024181 is 1814202202.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1995408900 + 26615281 = 44670^2 + 5159^2 .
It is a cyclic number.
It is not a de Polignac number, because 2022024181 - 217 = 2021893109 is a prime.
It is a super-2 number, since 2×20220241812 = 8177163577097441522, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2022024187) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1011012090 + 1011012091.
It is an arithmetic number, because the mean of its divisors is an integer number (1011012091).
Almost surely, 22022024181 is an apocalyptic number.
It is an amenable number.
2022024181 is a deficient number, since it is larger than the sum of its proper divisors (1).
2022024181 is an equidigital number, since it uses as much as digits as its factorization.
2022024181 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 512, while the sum is 22.
The square root of 2022024181 is about 44966.9231880501. The cubic root of 2022024181 is about 1264.5289650086.
Adding to 2022024181 its reverse (1814202202), we get a palindrome (3836226383).
The spelling of 2022024181 in words is "two billion, twenty-two million, twenty-four thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •