Base | Representation |
---|---|
bin | 1011101001110110000… |
… | …0110100000001011101 |
3 | 201010210001112200222212 |
4 | 2322131200310001131 |
5 | 11240013021321341 |
6 | 231550431050205 |
7 | 20315263304600 |
oct | 2723540640135 |
9 | 633701480885 |
10 | 200211120221 |
11 | 779aaa59a22 |
12 | 32976370965 |
13 | 15b58c9ab98 |
14 | 999415a337 |
15 | 531bc785eb |
hex | 2e9d83405d |
200211120221 has 6 divisors (see below), whose sum is σ = 232898650110. Its totient is φ = 171609531576.
The previous prime is 200211120217. The next prime is 200211120229. The reversal of 200211120221 is 122021112002.
It can be written as a sum of positive squares in only one way, i.e., 107482344025 + 92728776196 = 327845^2 + 304514^2 .
It is not a de Polignac number, because 200211120221 - 22 = 200211120217 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 200211120196 and 200211120205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200211120229) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2042970566 + ... + 2042970663.
It is an arithmetic number, because the mean of its divisors is an integer number (38816441685).
Almost surely, 2200211120221 is an apocalyptic number.
It is an amenable number.
200211120221 is a deficient number, since it is larger than the sum of its proper divisors (32687529889).
200211120221 is an equidigital number, since it uses as much as digits as its factorization.
200211120221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4085941243 (or 4085941236 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 200211120221 its reverse (122021112002), we get a palindrome (322232232223).
The spelling of 200211120221 in words is "two hundred billion, two hundred eleven million, one hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •