Base | Representation |
---|---|
bin | 11010010001010… |
… | …10001101100101 |
3 | 120100200011002212 |
4 | 31020222031211 |
5 | 422403430421 |
6 | 33511213205 |
7 | 5314101251 |
oct | 1510521545 |
9 | 510604085 |
10 | 220373861 |
11 | 103439164 |
12 | 61977205 |
13 | 3686b946 |
14 | 213a7261 |
15 | 14530e5b |
hex | d22a365 |
220373861 has 2 divisors, whose sum is σ = 220373862. Its totient is φ = 220373860.
The previous prime is 220373849. The next prime is 220373863. The reversal of 220373861 is 168373022.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 216648961 + 3724900 = 14719^2 + 1930^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-220373861 is a prime.
It is a super-2 number, since 2×2203738612 = 97129277224094642, which contains 22 as substring.
Together with 220373863, 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 (220373863) 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, 110186930 + 110186931.
It is an arithmetic number, because the mean of its divisors is an integer number (110186931).
Almost surely, 2220373861 is an apocalyptic number.
It is an amenable number.
220373861 is a deficient number, since it is larger than the sum of its proper divisors (1).
220373861 is an equidigital number, since it uses as much as digits as its factorization.
220373861 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12096, while the sum is 32.
The square root of 220373861 is about 14844.9944762536. The cubic root of 220373861 is about 604.0228389607.
The spelling of 220373861 in words is "two hundred twenty million, three hundred seventy-three thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •