Base | Representation |
---|---|
bin | 101101100001011100001011… |
… | …111001000110001100101011 |
3 | 222020212220021002212220212001 |
4 | 231201130023321012030223 |
5 | 202220220241101120021 |
6 | 1545451130014031431 |
7 | 60112462630111144 |
oct | 5541341371061453 |
9 | 866786232786761 |
10 | 200210100020011 |
11 | 5887a698aa4024 |
12 | 1a5560854a8577 |
13 | 8793967c18153 |
14 | 3762313262acb |
15 | 1822dce07c091 |
hex | b6170be4632b |
200210100020011 has 2 divisors, whose sum is σ = 200210100020012. Its totient is φ = 200210100020010.
The previous prime is 200210100019987. The next prime is 200210100020033. The reversal of 200210100020011 is 110020001012002.
200210100020011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-200210100020011 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 200210100020011.
It is not a weakly prime, because it can be changed into another prime (200210100020041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100105050010005 + 100105050010006.
It is an arithmetic number, because the mean of its divisors is an integer number (100105050010006).
Almost surely, 2200210100020011 is an apocalyptic number.
200210100020011 is a deficient number, since it is larger than the sum of its proper divisors (1).
200210100020011 is an equidigital number, since it uses as much as digits as its factorization.
200210100020011 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 200210100020011 its reverse (110020001012002), we get a palindrome (310230101032013).
The spelling of 200210100020011 in words is "two hundred trillion, two hundred ten billion, one hundred million, twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •