Base | Representation |
---|---|
bin | 11101001000100110011… |
… | …101110100100010100001 |
3 | 21002101202210120120101021 |
4 | 131020212131310202201 |
5 | 230300300112032041 |
6 | 4131430241405441 |
7 | 264434623105126 |
oct | 35104635644241 |
9 | 7071683516337 |
10 | 2002100111521 |
11 | 7020a4355744 |
12 | 28402b339881 |
13 | 116a49690c03 |
14 | 6cc8b76874d |
15 | 3712c567cd1 |
hex | 1d2267748a1 |
2002100111521 has 2 divisors, whose sum is σ = 2002100111522. Its totient is φ = 2002100111520.
The previous prime is 2002100111513. The next prime is 2002100111527. The reversal of 2002100111521 is 1251110012002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1833557019921 + 168543091600 = 1354089^2 + 410540^2 .
It is a cyclic number.
It is not a de Polignac number, because 2002100111521 - 23 = 2002100111513 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2002100111495 and 2002100111504.
It is not a weakly prime, because it can be changed into another prime (2002100111527) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1001050055760 + 1001050055761.
It is an arithmetic number, because the mean of its divisors is an integer number (1001050055761).
Almost surely, 22002100111521 is an apocalyptic number.
It is an amenable number.
2002100111521 is a deficient number, since it is larger than the sum of its proper divisors (1).
2002100111521 is an equidigital number, since it uses as much as digits as its factorization.
2002100111521 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 40, while the sum is 16.
Adding to 2002100111521 its reverse (1251110012002), we get a palindrome (3253210123523).
The spelling of 2002100111521 in words is "two trillion, two billion, one hundred million, one hundred eleven thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •