Base | Representation |
---|---|
bin | 110000001101010011111100… |
… | …111111110111011010001001 |
3 | 1000210201000021202002220202212 |
4 | 300031103330333313122021 |
5 | 210242223012102401301 |
6 | 2030533035113034505 |
7 | 62442004166150156 |
oct | 6015237477673211 |
9 | 1023630252086685 |
10 | 212021010200201 |
11 | 61613672977574 |
12 | 1b9431133b5a35 |
13 | 913c659725297 |
14 | 3a4dc2bb2d22d |
15 | 197a2467744bb |
hex | c0d4fcff7689 |
212021010200201 has 2 divisors, whose sum is σ = 212021010200202. Its totient is φ = 212021010200200.
The previous prime is 212021010200179. The next prime is 212021010200243. The reversal of 212021010200201 is 102002010120212.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 211786898410000 + 234111790201 = 14552900^2 + 483851^2 .
It is a cyclic number.
It is not a de Polignac number, because 212021010200201 - 230 = 212019936458377 is a prime.
It is a super-2 number, since 2×2120210102002012 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (212021010200261) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106010505100100 + 106010505100101.
It is an arithmetic number, because the mean of its divisors is an integer number (106010505100101).
Almost surely, 2212021010200201 is an apocalyptic number.
It is an amenable number.
212021010200201 is a deficient number, since it is larger than the sum of its proper divisors (1).
212021010200201 is an equidigital number, since it uses as much as digits as its factorization.
212021010200201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 212021010200201 its reverse (102002010120212), we get a palindrome (314023020320413).
The spelling of 212021010200201 in words is "two hundred twelve trillion, twenty-one billion, ten million, two hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •