Base | Representation |
---|---|
bin | 11101001000101101100… |
… | …111001111010100011001 |
3 | 21002102002011012121021201 |
4 | 131020231213033110121 |
5 | 230301021311133032 |
6 | 4131450203434201 |
7 | 264440610241366 |
oct | 35105547172431 |
9 | 7072064177251 |
10 | 2002220021017 |
11 | 7021560054a7 |
12 | 284063525961 |
13 | 116a68485888 |
14 | 6cc9d65d46d |
15 | 37137d518e7 |
hex | 1d22d9cf519 |
2002220021017 has 2 divisors, whose sum is σ = 2002220021018. Its totient is φ = 2002220021016.
The previous prime is 2002220020987. The next prime is 2002220021027. The reversal of 2002220021017 is 7101200222002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1629901608976 + 372318412041 = 1276676^2 + 610179^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2002220021017 is a prime.
It is a super-2 number, since 2×20022200210172 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2002220020985 and 2002220021003.
It is not a weakly prime, because it can be changed into another prime (2002220021027) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1001110010508 + 1001110010509.
It is an arithmetic number, because the mean of its divisors is an integer number (1001110010509).
Almost surely, 22002220021017 is an apocalyptic number.
It is an amenable number.
2002220021017 is a deficient number, since it is larger than the sum of its proper divisors (1).
2002220021017 is an equidigital number, since it uses as much as digits as its factorization.
2002220021017 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 224, while the sum is 19.
Adding to 2002220021017 its reverse (7101200222002), we get a palindrome (9103420243019).
The spelling of 2002220021017 in words is "two trillion, two billion, two hundred twenty million, twenty-one thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •