Base | Representation |
---|---|
bin | 1100110111101011001… |
… | …1001001110110101101 |
3 | 210010201002100201102122 |
4 | 3031322303021312231 |
5 | 12110310002442112 |
6 | 245323520402325 |
7 | 21655103161202 |
oct | 3157263116655 |
9 | 703632321378 |
10 | 221103562157 |
11 | 85851218865 |
12 | 36a271763a5 |
13 | 17b08523c6a |
14 | a9b6b91ca9 |
15 | 5b4102b872 |
hex | 337acc9dad |
221103562157 has 2 divisors, whose sum is σ = 221103562158. Its totient is φ = 221103562156.
The previous prime is 221103562133. The next prime is 221103562159. The reversal of 221103562157 is 751265301122.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 178646547556 + 42457014601 = 422666^2 + 206051^2 .
It is a cyclic number.
It is not a de Polignac number, because 221103562157 - 28 = 221103561901 is a prime.
Together with 221103562159, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (221103562159) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110551781078 + 110551781079.
It is an arithmetic number, because the mean of its divisors is an integer number (110551781079).
Almost surely, 2221103562157 is an apocalyptic number.
It is an amenable number.
221103562157 is a deficient number, since it is larger than the sum of its proper divisors (1).
221103562157 is an equidigital number, since it uses as much as digits as its factorization.
221103562157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 25200, while the sum is 35.
Adding to 221103562157 its reverse (751265301122), we get a palindrome (972368863279).
The spelling of 221103562157 in words is "two hundred twenty-one billion, one hundred three million, five hundred sixty-two thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •