Base | Representation |
---|---|
bin | 11101001000101101101… |
… | …110110101001111101101 |
3 | 21002102002021221201112121 |
4 | 131020231232311033231 |
5 | 230301022313330443 |
6 | 4131450314232541 |
7 | 264440633201233 |
oct | 35105556651755 |
9 | 7072067851477 |
10 | 2002222011373 |
11 | 702157144921 |
12 | 284064125751 |
13 | 116a68a017bc |
14 | 6cc9da1a953 |
15 | 371380e64ed |
hex | 1d22dbb53ed |
2002222011373 has 2 divisors, whose sum is σ = 2002222011374. Its totient is φ = 2002222011372.
The previous prime is 2002222011337. The next prime is 2002222011379. The reversal of 2002222011373 is 3731102222002.
Together with previous prime (2002222011337) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1021096103049 + 981125908324 = 1010493^2 + 990518^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2002222011373 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2002222011379) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1001111005686 + 1001111005687.
It is an arithmetic number, because the mean of its divisors is an integer number (1001111005687).
Almost surely, 22002222011373 is an apocalyptic number.
It is an amenable number.
2002222011373 is a deficient number, since it is larger than the sum of its proper divisors (1).
2002222011373 is an equidigital number, since it uses as much as digits as its factorization.
2002222011373 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2016, while the sum is 25.
Adding to 2002222011373 its reverse (3731102222002), we get a palindrome (5733324233375).
The spelling of 2002222011373 in words is "two trillion, two billion, two hundred twenty-two million, eleven thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •