Base | Representation |
---|---|
bin | 11010010010010… |
… | …01011110001101 |
3 | 120100220122202002 |
4 | 31021021132031 |
5 | 422422030101 |
6 | 33514042045 |
7 | 5315143454 |
oct | 1511113615 |
9 | 510818662 |
10 | 220501901 |
11 | 103516384 |
12 | 61a19325 |
13 | 368b4cc9 |
14 | 213dbb9b |
15 | 14558d6b |
hex | d24978d |
220501901 has 2 divisors, whose sum is σ = 220501902. Its totient is φ = 220501900.
The previous prime is 220501871. The next prime is 220501913. The reversal of 220501901 is 109105022.
220501901 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 215326276 + 5175625 = 14674^2 + 2275^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-220501901 is a prime.
It is a super-2 number, since 2×2205019012 = 97242176689227602, which contains 22 as substring.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (220500901) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110250950 + 110250951.
It is an arithmetic number, because the mean of its divisors is an integer number (110250951).
Almost surely, 2220501901 is an apocalyptic number.
It is an amenable number.
220501901 is a deficient number, since it is larger than the sum of its proper divisors (1).
220501901 is an equidigital number, since it uses as much as digits as its factorization.
220501901 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 180, while the sum is 20.
The square root of 220501901 is about 14849.3064147791. The cubic root of 220501901 is about 604.1397979479.
Adding to 220501901 its reverse (109105022), we get a palindrome (329606923).
The spelling of 220501901 in words is "two hundred twenty million, five hundred one thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •