Base | Representation |
---|---|
bin | 1011101010001011100… |
… | …0000110011110110101 |
3 | 201011000022212201102212 |
4 | 2322202320012132311 |
5 | 11240204041024341 |
6 | 232003403543205 |
7 | 20320435232201 |
oct | 2724270063665 |
9 | 634008781385 |
10 | 200301111221 |
11 | 77a46834552 |
12 | 329a052ab05 |
13 | 15b718189b3 |
14 | 99a20a3b01 |
15 | 5324b025eb |
hex | 2ea2e067b5 |
200301111221 has 2 divisors, whose sum is σ = 200301111222. Its totient is φ = 200301111220.
The previous prime is 200301111191. The next prime is 200301111343. The reversal of 200301111221 is 122111103002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 172449172900 + 27851938321 = 415270^2 + 166889^2 .
It is a cyclic number.
It is not a de Polignac number, because 200301111221 - 222 = 200296916917 is a prime.
It is a super-2 number, since 2×2003011112212 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 200301111196 and 200301111205.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200301111121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100150555610 + 100150555611.
It is an arithmetic number, because the mean of its divisors is an integer number (100150555611).
Almost surely, 2200301111221 is an apocalyptic number.
It is an amenable number.
200301111221 is a deficient number, since it is larger than the sum of its proper divisors (1).
200301111221 is an equidigital number, since it uses as much as digits as its factorization.
200301111221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 200301111221 its reverse (122111103002), we get a palindrome (322412214223).
The spelling of 200301111221 in words is "two hundred billion, three hundred one million, one hundred eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •