Base | Representation |
---|---|
bin | 101101100001010010111110… |
… | …011010011110010101101001 |
3 | 222020211221201212110121222220 |
4 | 231201102332122132111221 |
5 | 202220040012303242301 |
6 | 1545442412405104253 |
7 | 60111662561121213 |
oct | 5541227632362551 |
9 | 866757655417886 |
10 | 200200210212201 |
11 | 58876483502041 |
12 | 1a5541853b8089 |
13 | 8792a4cccc674 |
14 | 3761a559c55b3 |
15 | 1822a00bd8936 |
hex | b614be69e569 |
200200210212201 has 4 divisors (see below), whose sum is σ = 266933613616272. Its totient is φ = 133466806808132.
The previous prime is 200200210212179. The next prime is 200200210212259. The reversal of 200200210212201 is 102212012002002.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 200200210212201 - 223 = 200200201823593 is a prime.
It is not an unprimeable number, because it can be changed into a prime (200200210212601) 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, 33366701702031 + ... + 33366701702036.
It is an arithmetic number, because the mean of its divisors is an integer number (66733403404068).
Almost surely, 2200200210212201 is an apocalyptic number.
It is an amenable number.
200200210212201 is a deficient number, since it is larger than the sum of its proper divisors (66733403404071).
200200210212201 is an equidigital number, since it uses as much as digits as its factorization.
200200210212201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 66733403404070.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 200200210212201 its reverse (102212012002002), we get a palindrome (302412222214203).
The spelling of 200200210212201 in words is "two hundred trillion, two hundred billion, two hundred ten million, two hundred twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •