Base | Representation |
---|---|
bin | 101101100001010010111101… |
… | …111011111100101011011011 |
3 | 222020211221201022102002001111 |
4 | 231201102331323330223123 |
5 | 202220040003231210021 |
6 | 1545442411521401151 |
7 | 60111662433112213 |
oct | 5541227573745333 |
9 | 866757638362044 |
10 | 200200202210011 |
11 | 58876479a36963 |
12 | 1a5541827991b7 |
13 | 8792a4b45a243 |
14 | 3761a54901243 |
15 | 1822a001578e1 |
hex | b614bdefcadb |
200200202210011 has 4 divisors (see below), whose sum is σ = 200200299462352. Its totient is φ = 200200104957672.
The previous prime is 200200202209981. The next prime is 200200202210017. The reversal of 200200202210011 is 110012202002002.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 200200202210011 - 237 = 200062763256539 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200200202209973 and 200200202210000.
It is not an unprimeable number, because it can be changed into a prime (200200202210017) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 45470040 + ... + 49678213.
It is an arithmetic number, because the mean of its divisors is an integer number (50050074865588).
Almost surely, 2200200202210011 is an apocalyptic number.
200200202210011 is a deficient number, since it is larger than the sum of its proper divisors (97252341).
200200202210011 is an equidigital number, since it uses as much as digits as its factorization.
200200202210011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 97252340.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 200200202210011 its reverse (110012202002002), we get a palindrome (310212404212013).
The spelling of 200200202210011 in words is "two hundred trillion, two hundred billion, two hundred two million, two hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •