Base | Representation |
---|---|
bin | 11101001000100111110… |
… | …010000101011111000111 |
3 | 21002101211100010211111021 |
4 | 131020213302011133013 |
5 | 230300321240413111 |
6 | 4131432351052011 |
7 | 264435311626051 |
oct | 35104762053707 |
9 | 7071740124437 |
10 | 2002122201031 |
11 | 702105872937 |
12 | 284036811007 |
13 | 116a51126424 |
14 | 6cc906788d1 |
15 | 3712e47cd71 |
hex | 1d227c857c7 |
2002122201031 has 2 divisors, whose sum is σ = 2002122201032. Its totient is φ = 2002122201030.
The previous prime is 2002122201029. The next prime is 2002122201097. The reversal of 2002122201031 is 1301022212002.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2002122201031 - 21 = 2002122201029 is a prime.
It is a super-3 number, since 3×20021222010313 (a number of 38 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
Together with 2002122201029, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 2002122200996 and 2002122201014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2002122204031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1001061100515 + 1001061100516.
It is an arithmetic number, because the mean of its divisors is an integer number (1001061100516).
Almost surely, 22002122201031 is an apocalyptic number.
2002122201031 is a deficient number, since it is larger than the sum of its proper divisors (1).
2002122201031 is an equidigital number, since it uses as much as digits as its factorization.
2002122201031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 2002122201031 its reverse (1301022212002), we get a palindrome (3303144413033).
The spelling of 2002122201031 in words is "two trillion, two billion, one hundred twenty-two million, two hundred one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •