Base | Representation |
---|---|
bin | 101101100001010010111101… |
… | …111000001000100010011011 |
3 | 222020211221201020112021022110 |
4 | 231201102331320020202123 |
5 | 202220040003002210021 |
6 | 1545442411444123403 |
7 | 60111662421445602 |
oct | 5541227570104233 |
9 | 866757636467273 |
10 | 200200201210011 |
11 | 58876479413612 |
12 | 1a554182396563 |
13 | 8792a4b19a022 |
14 | 3761a54720a39 |
15 | 1822a0000b476 |
hex | b614bde0889b |
200200201210011 has 8 divisors (see below), whose sum is σ = 266967872231440. Its totient is φ = 133449665497632.
The previous prime is 200200201210007. The next prime is 200200201210133. The reversal of 200200201210011 is 110012102002002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 200200201210011 - 22 = 200200201210007 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200200201010011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4283800000 + ... + 4283846733.
It is an arithmetic number, because the mean of its divisors is an integer number (33370984028930).
Almost surely, 2200200201210011 is an apocalyptic number.
200200201210011 is a deficient number, since it is larger than the sum of its proper divisors (66767671021429).
200200201210011 is an equidigital number, since it uses as much as digits as its factorization.
200200201210011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8567654525.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 200200201210011 its reverse (110012102002002), we get a palindrome (310212303212013).
The spelling of 200200201210011 in words is "two hundred trillion, two hundred billion, two hundred one million, two hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •