Base | Representation |
---|---|
bin | 101101011111111111111111… |
… | …000010110010111101000101 |
3 | 222020112102201122021112201112 |
4 | 231133333333002302331011 |
5 | 202212110013123223023 |
6 | 1545333434220334405 |
7 | 60102356416450325 |
oct | 5537777702627505 |
9 | 866472648245645 |
10 | 200111100211013 |
11 | 58841706202262 |
12 | 1a53aa566a4405 |
13 | 878751b6b1804 |
14 | 375b600d9d285 |
15 | 1820537a60478 |
hex | b5ffff0b2f45 |
200111100211013 has 8 divisors (see below), whose sum is σ = 207102798211680. Its totient is φ = 193125489892720.
The previous prime is 200111100211003. The next prime is 200111100211039. The reversal of 200111100211013 is 310112001111002.
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 200111100211013 - 216 = 200111100145477 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200111100211003) 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, 1521853703 + ... + 1521985188.
It is an arithmetic number, because the mean of its divisors is an integer number (25887849776460).
Almost surely, 2200111100211013 is an apocalyptic number.
It is an amenable number.
200111100211013 is a deficient number, since it is larger than the sum of its proper divisors (6991698000667).
200111100211013 is a wasteful number, since it uses less digits than its factorization.
200111100211013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3043841187.
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 200111100211013 its reverse (310112001111002), we get a palindrome (510223101322015).
The spelling of 200111100211013 in words is "two hundred trillion, one hundred eleven billion, one hundred million, two hundred eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •