Base | Representation |
---|---|
bin | 101101011111110101101010… |
… | …101010111101111101111111 |
3 | 222020111101010111210102022002 |
4 | 231133311222222331331333 |
5 | 202211414320334031421 |
6 | 1545324403002412515 |
7 | 60101515025644616 |
oct | 5537655252757577 |
9 | 866441114712262 |
10 | 200100021002111 |
11 | 58837a4029366a |
12 | 1a53888420113b |
13 | 8786474242bb9 |
14 | 375ac6d79087d |
15 | 18200da076b0b |
hex | b5fd6aabdf7f |
200100021002111 has 8 divisors (see below), whose sum is σ = 200124734611680. Its totient is φ = 200075308095712.
The previous prime is 200100021002017. The next prime is 200100021002113. The reversal of 200100021002111 is 111200120001002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 200100021002111 - 210 = 200100021001087 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200100021002092 and 200100021002101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200100021002113) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 771774845 + ... + 772034073.
It is an arithmetic number, because the mean of its divisors is an integer number (25015591826460).
Almost surely, 2200100021002111 is an apocalyptic number.
200100021002111 is a deficient number, since it is larger than the sum of its proper divisors (24713609569).
200100021002111 is an equidigital number, since it uses as much as digits as its factorization.
200100021002111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 351585.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 200100021002111 its reverse (111200120001002), we get a palindrome (311300141003113).
The spelling of 200100021002111 in words is "two hundred trillion, one hundred billion, twenty-one million, two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •