Base | Representation |
---|---|
bin | 1100110100011000100… |
… | …0101011000111011011 |
3 | 210001102111210200001122 |
4 | 3031012020223013123 |
5 | 12102002310322341 |
6 | 245100115035455 |
7 | 21624154131212 |
oct | 3150610530733 |
9 | 701374720048 |
10 | 220220010971 |
11 | 85438500774 |
12 | 3681b29bb8b |
13 | 179c74694cc |
14 | a9316b8079 |
15 | 5add69d94b |
hex | 334622b1db |
220220010971 has 2 divisors, whose sum is σ = 220220010972. Its totient is φ = 220220010970.
The previous prime is 220220010961. The next prime is 220220011009. The reversal of 220220010971 is 179010022022.
220220010971 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 is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-220220010971 is a prime.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 220220010971.
It is not a weakly prime, because it can be changed into another prime (220220010961) 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, 110110005485 + 110110005486.
It is an arithmetic number, because the mean of its divisors is an integer number (110110005486).
Almost surely, 2220220010971 is an apocalyptic number.
220220010971 is a deficient number, since it is larger than the sum of its proper divisors (1).
220220010971 is an equidigital number, since it uses as much as digits as its factorization.
220220010971 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1008, while the sum is 26.
Adding to 220220010971 its reverse (179010022022), we get a palindrome (399230032993).
The spelling of 220220010971 in words is "two hundred twenty billion, two hundred twenty million, ten thousand, nine hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •