Base | Representation |
---|---|
bin | 11101001000100110100… |
… | …101011110111110001011 |
3 | 21002101202221100121221122 |
4 | 131020212211132332023 |
5 | 230300301120322311 |
6 | 4131430352425455 |
7 | 264434646142535 |
oct | 35104645367613 |
9 | 7071687317848 |
10 | 2002102120331 |
11 | 7020a54a7a15 |
12 | 28402bb4828b |
13 | 116a49c15361 |
14 | 6cc8bb2c855 |
15 | 3712c8130db |
hex | 1d22695ef8b |
2002102120331 has 2 divisors, whose sum is σ = 2002102120332. Its totient is φ = 2002102120330.
The previous prime is 2002102120313. The next prime is 2002102120357. The reversal of 2002102120331 is 1330212012002.
Together with previous prime (2002102120313) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2002102120331 - 26 = 2002102120267 is a prime.
It is a super-2 number, since 2×20021021203312 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2002102120391) 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, 1001051060165 + 1001051060166.
It is an arithmetic number, because the mean of its divisors is an integer number (1001051060166).
Almost surely, 22002102120331 is an apocalyptic number.
2002102120331 is a deficient number, since it is larger than the sum of its proper divisors (1).
2002102120331 is an equidigital number, since it uses as much as digits as its factorization.
2002102120331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 2002102120331 its reverse (1330212012002), we get a palindrome (3332314132333).
The spelling of 2002102120331 in words is "two trillion, two billion, one hundred two million, one hundred twenty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •