Base | Representation |
---|---|
bin | 101101011111110101101010… |
… | …101011000010010111001111 |
3 | 222020111101010111211022222202 |
4 | 231133311222223002113033 |
5 | 202211414320340120421 |
6 | 1545324403003032115 |
7 | 60101515026051242 |
oct | 5537655253022717 |
9 | 866441114738882 |
10 | 200100021020111 |
11 | 58837a402a6143 |
12 | 1a53888420b63b |
13 | 878647424b154 |
14 | 375ac6d797259 |
15 | 18200da07c10b |
hex | b5fd6aac25cf |
200100021020111 has 2 divisors, whose sum is σ = 200100021020112. Its totient is φ = 200100021020110.
The previous prime is 200100021020063. The next prime is 200100021020117. The reversal of 200100021020111 is 111020120001002.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-200100021020111 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 200100021020092 and 200100021020101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200100021020117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100050010510055 + 100050010510056.
It is an arithmetic number, because the mean of its divisors is an integer number (100050010510056).
Almost surely, 2200100021020111 is an apocalyptic number.
200100021020111 is a deficient number, since it is larger than the sum of its proper divisors (1).
200100021020111 is an equidigital number, since it uses as much as digits as its factorization.
200100021020111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 200100021020111 its reverse (111020120001002), we get a palindrome (311120141021113).
The spelling of 200100021020111 in words is "two hundred trillion, one hundred billion, twenty-one million, twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •