Base | Representation |
---|---|
bin | 11101001000100110011… |
… | …101011010000111101111 |
3 | 21002101202210101001221111 |
4 | 131020212131122013233 |
5 | 230300300100101221 |
6 | 4131430235212451 |
7 | 264434622144502 |
oct | 35104635320757 |
9 | 7071683331844 |
10 | 2002100003311 |
11 | 7020a4291411 |
12 | 28402b2a7127 |
13 | 116a49653895 |
14 | 6cc8b73b139 |
15 | 3712c545be1 |
hex | 1d22675a1ef |
2002100003311 has 2 divisors, whose sum is σ = 2002100003312. Its totient is φ = 2002100003310.
The previous prime is 2002100003303. The next prime is 2002100003329. The reversal of 2002100003311 is 1133000012002.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2002100003311 - 23 = 2002100003303 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2002100003291 and 2002100003300.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2002100603311) 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, 1001050001655 + 1001050001656.
It is an arithmetic number, because the mean of its divisors is an integer number (1001050001656).
Almost surely, 22002100003311 is an apocalyptic number.
2002100003311 is a deficient number, since it is larger than the sum of its proper divisors (1).
2002100003311 is an equidigital number, since it uses as much as digits as its factorization.
2002100003311 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 2002100003311 its reverse (1133000012002), we get a palindrome (3135100015313).
The spelling of 2002100003311 in words is "two trillion, two billion, one hundred million, three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •