Base | Representation |
---|---|
bin | 11101011011001000101… |
… | …001101100011000100001 |
3 | 21011022010201121112221122 |
4 | 131123020221230120201 |
5 | 231112024224031032 |
6 | 4144521110502025 |
7 | 266041032636053 |
oct | 35331051543041 |
9 | 7138121545848 |
10 | 2022001002017 |
11 | 70a586941287 |
12 | 287a64064915 |
13 | 11889b677469 |
14 | 6dc188118d3 |
15 | 378e4758012 |
hex | 1d6c8a6c621 |
2022001002017 has 2 divisors, whose sum is σ = 2022001002018. Its totient is φ = 2022001002016.
The previous prime is 2022001001971. The next prime is 2022001002097. The reversal of 2022001002017 is 7102001002202.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1481468728336 + 540532273681 = 1217156^2 + 735209^2 .
It is a cyclic number.
It is not a de Polignac number, because 2022001002017 - 212 = 2022000997921 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2022001001986 and 2022001002004.
It is not a weakly prime, because it can be changed into another prime (2022001002097) 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 as a sum of consecutive naturals, namely, 1011000501008 + 1011000501009.
It is an arithmetic number, because the mean of its divisors is an integer number (1011000501009).
Almost surely, 22022001002017 is an apocalyptic number.
It is an amenable number.
2022001002017 is a deficient number, since it is larger than the sum of its proper divisors (1).
2022001002017 is an equidigital number, since it uses as much as digits as its factorization.
2022001002017 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 112, while the sum is 17.
Adding to 2022001002017 its reverse (7102001002202), we get a palindrome (9124002004219).
The spelling of 2022001002017 in words is "two trillion, twenty-two billion, one million, two thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •