Base | Representation |
---|---|
bin | 11101011010001101101… |
… | …001111110011000110001 |
3 | 21011012120202011102022001 |
4 | 131122031221332120301 |
5 | 231103012333020032 |
6 | 4144234552214001 |
7 | 266004353633206 |
oct | 35321551763061 |
9 | 7135522142261 |
10 | 2021011220017 |
11 | 70a119167429 |
12 | 28782869a301 |
13 | 1187715a713a |
14 | 6db631a3cad |
15 | 378878e43e7 |
hex | 1d68da7e631 |
2021011220017 has 2 divisors, whose sum is σ = 2021011220018. Its totient is φ = 2021011220016.
The previous prime is 2021011219921. The next prime is 2021011220023. The reversal of 2021011220017 is 7100221101202.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2006007664896 + 15003555121 = 1416336^2 + 122489^2 .
It is a cyclic number.
It is not a de Polignac number, because 2021011220017 - 215 = 2021011187249 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2021011219976 and 2021011220003.
It is not a weakly prime, because it can be changed into another prime (2021011220027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1010505610008 + 1010505610009.
It is an arithmetic number, because the mean of its divisors is an integer number (1010505610009).
Almost surely, 22021011220017 is an apocalyptic number.
It is an amenable number.
2021011220017 is a deficient number, since it is larger than the sum of its proper divisors (1).
2021011220017 is an equidigital number, since it uses as much as digits as its factorization.
2021011220017 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 19.
Adding to 2021011220017 its reverse (7100221101202), we get a palindrome (9121232321219).
The spelling of 2021011220017 in words is "two trillion, twenty-one billion, eleven million, two hundred twenty thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •