Base | Representation |
---|---|
bin | 1100111000000010100… |
… | …0000010100000111001 |
3 | 210010221220021220201211 |
4 | 3032000220002200321 |
5 | 12111010013434201 |
6 | 245341331443121 |
7 | 21660401061451 |
oct | 3160050024071 |
9 | 703856256654 |
10 | 221201311801 |
11 | 858a1412598 |
12 | 36a53a564a1 |
13 | 17b2285a3a2 |
14 | a9c5b58d61 |
15 | 5b498d9651 |
hex | 3380a02839 |
221201311801 has 2 divisors, whose sum is σ = 221201311802. Its totient is φ = 221201311800.
The previous prime is 221201311787. The next prime is 221201311823. The reversal of 221201311801 is 108113102122.
It is an a-pointer prime, because the next prime (221201311823) can be obtained adding 221201311801 to its sum of digits (22).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 220241551401 + 959760400 = 469299^2 + 30980^2 .
It is a cyclic number.
It is not a de Polignac number, because 221201311801 - 229 = 220664440889 is a prime.
It is not a weakly prime, because it can be changed into another prime (221201311831) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110600655900 + 110600655901.
It is an arithmetic number, because the mean of its divisors is an integer number (110600655901).
Almost surely, 2221201311801 is an apocalyptic number.
It is an amenable number.
221201311801 is a deficient number, since it is larger than the sum of its proper divisors (1).
221201311801 is an equidigital number, since it uses as much as digits as its factorization.
221201311801 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 22.
Adding to 221201311801 its reverse (108113102122), we get a palindrome (329314413923).
The spelling of 221201311801 in words is "two hundred twenty-one billion, two hundred one million, three hundred eleven thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •