Base | Representation |
---|---|
bin | 11101001000100111000… |
… | …100110001010101001101 |
3 | 21002101210111210022112001 |
4 | 131020213010301111031 |
5 | 230300310220300442 |
6 | 4131431244312301 |
7 | 264435105642232 |
oct | 35104704612515 |
9 | 7071714708461 |
10 | 2002110321997 |
11 | 7020aa099a55 |
12 | 284032842691 |
13 | 116a4b827506 |
14 | 6cc8cc65789 |
15 | 3712d3d32b7 |
hex | 1d22713154d |
2002110321997 has 2 divisors, whose sum is σ = 2002110321998. Its totient is φ = 2002110321996.
The previous prime is 2002110321989. The next prime is 2002110322013. The reversal of 2002110321997 is 7991230112002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1987045459876 + 15064862121 = 1409626^2 + 122739^2 .
It is a cyclic number.
It is not a de Polignac number, because 2002110321997 - 23 = 2002110321989 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2002110321917) 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, 1001055160998 + 1001055160999.
It is an arithmetic number, because the mean of its divisors is an integer number (1001055160999).
Almost surely, 22002110321997 is an apocalyptic number.
It is an amenable number.
2002110321997 is a deficient number, since it is larger than the sum of its proper divisors (1).
2002110321997 is an equidigital number, since it uses as much as digits as its factorization.
2002110321997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13608, while the sum is 37.
Adding to 2002110321997 its reverse (7991230112002), we get a palindrome (9993340433999).
The spelling of 2002110321997 in words is "two trillion, two billion, one hundred ten million, three hundred twenty-one thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.186 sec. • engine limits •