Base | Representation |
---|---|
bin | 11101001000100111101… |
… | …001101110110101010011 |
3 | 21002101211012000120110101 |
4 | 131020213221232311103 |
5 | 230300320210323331 |
6 | 4131432232113231 |
7 | 264435254205304 |
oct | 35104751566523 |
9 | 7071735016411 |
10 | 2002120011091 |
11 | 702104607572 |
12 | 284035b35817 |
13 | 116a5083a6c5 |
14 | 6cc902687ab |
15 | 3712e199061 |
hex | 1d227a6ed53 |
2002120011091 has 2 divisors, whose sum is σ = 2002120011092. Its totient is φ = 2002120011090.
The previous prime is 2002120011077. The next prime is 2002120011109. The reversal of 2002120011091 is 1901100212002.
It is a happy number.
Together with next prime (2002120011109) 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 2002120011091 - 213 = 2002120002899 is a prime.
It is a super-2 number, since 2×20021200110912 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2002120011011) 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, 1001060005545 + 1001060005546.
It is an arithmetic number, because the mean of its divisors is an integer number (1001060005546).
Almost surely, 22002120011091 is an apocalyptic number.
2002120011091 is a deficient number, since it is larger than the sum of its proper divisors (1).
2002120011091 is an equidigital number, since it uses as much as digits as its factorization.
2002120011091 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 2002120011091 its reverse (1901100212002), we get a palindrome (3903220223093).
The spelling of 2002120011091 in words is "two trillion, two billion, one hundred twenty million, eleven thousand, ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •