Base | Representation |
---|---|
bin | 1100110111101010100… |
… | …1110101101000000001 |
3 | 210010200220202122102102 |
4 | 3031322221311220001 |
5 | 12110303341320001 |
6 | 245323352200145 |
7 | 21655043340206 |
oct | 3157251655001 |
9 | 703626678372 |
10 | 221101120001 |
11 | 8584a8aaa53 |
12 | 36a26399055 |
13 | 17b07b7a4b8 |
14 | a9b6717cad |
15 | 5b40be7e6b |
hex | 337aa75a01 |
221101120001 has 2 divisors, whose sum is σ = 221101120002. Its totient is φ = 221101120000.
The previous prime is 221101119991. The next prime is 221101120021. The reversal of 221101120001 is 100021101122.
221101120001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 154115915776 + 66985204225 = 392576^2 + 258815^2 .
It is a cyclic number.
It is not a de Polignac number, because 221101120001 - 26 = 221101119937 is a prime.
It is not a weakly prime, because it can be changed into another prime (221101120021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110550560000 + 110550560001.
It is an arithmetic number, because the mean of its divisors is an integer number (110550560001).
Almost surely, 2221101120001 is an apocalyptic number.
It is an amenable number.
221101120001 is a deficient number, since it is larger than the sum of its proper divisors (1).
221101120001 is an equidigital number, since it uses as much as digits as its factorization.
221101120001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 221101120001 its reverse (100021101122), we get a palindrome (321122221123).
The spelling of 221101120001 in words is "two hundred twenty-one billion, one hundred one million, one hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •