Base | Representation |
---|---|
bin | 1100110011111110010… |
… | …1000011101001001101 |
3 | 210001010211211002102001 |
4 | 3030333211003221031 |
5 | 12101241130322312 |
6 | 245041145232301 |
7 | 21621350136364 |
oct | 3147745035115 |
9 | 701124732361 |
10 | 220110010957 |
11 | 853913aa071 |
12 | 367aa492691 |
13 | 179aa734145 |
14 | a920c427db |
15 | 5ad3bc1057 |
hex | 333f943a4d |
220110010957 has 2 divisors, whose sum is σ = 220110010958. Its totient is φ = 220110010956.
The previous prime is 220110010937. The next prime is 220110010963. The reversal of 220110010957 is 759010011022.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 173134216836 + 46975794121 = 416094^2 + 216739^2 .
It is a cyclic number.
It is not a de Polignac number, because 220110010957 - 27 = 220110010829 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (220110010927) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110055005478 + 110055005479.
It is an arithmetic number, because the mean of its divisors is an integer number (110055005479).
Almost surely, 2220110010957 is an apocalyptic number.
It is an amenable number.
220110010957 is a deficient number, since it is larger than the sum of its proper divisors (1).
220110010957 is an equidigital number, since it uses as much as digits as its factorization.
220110010957 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1260, while the sum is 28.
Adding to 220110010957 its reverse (759010011022), we get a palindrome (979120021979).
The spelling of 220110010957 in words is "two hundred twenty billion, one hundred ten million, ten thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •