Base | Representation |
---|---|
bin | 11001010010111… |
… | …10101100001001 |
3 | 112210021212221201 |
4 | 30221132230021 |
5 | 413310401301 |
6 | 33020104201 |
7 | 5154446323 |
oct | 1451365411 |
9 | 483255851 |
10 | 212200201 |
11 | a9866174 |
12 | 5b095061 |
13 | 34c69465 |
14 | 2027a613 |
15 | 13969201 |
hex | ca5eb09 |
212200201 has 4 divisors (see below), whose sum is σ = 212410692. Its totient is φ = 211989712.
The previous prime is 212200187. The next prime is 212200211. The reversal of 212200201 is 102002212.
212200201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 42575625 + 169624576 = 6525^2 + 13024^2 .
It is a cyclic number.
It is not a de Polignac number, because 212200201 - 211 = 212198153 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (212200211) 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, 103726 + ... + 105751.
It is an arithmetic number, because the mean of its divisors is an integer number (53102673).
Almost surely, 2212200201 is an apocalyptic number.
It is an amenable number.
212200201 is a deficient number, since it is larger than the sum of its proper divisors (210491).
212200201 is a wasteful number, since it uses less digits than its factorization.
212200201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 210490.
The product of its (nonzero) digits is 16, while the sum is 10.
The square root of 212200201 is about 14567.0930868173. The cubic root of 212200201 is about 596.4608324613.
Adding to 212200201 its reverse (102002212), we get a palindrome (314202413).
The spelling of 212200201 in words is "two hundred twelve million, two hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •