Base | Representation |
---|---|
bin | 11010001111010… |
… | …10000111000101 |
3 | 120100011210221102 |
4 | 31013222013011 |
5 | 422322030201 |
6 | 33501425445 |
7 | 5311625624 |
oct | 1507520705 |
9 | 510153842 |
10 | 220111301 |
11 | 103279973 |
12 | 6186b285 |
13 | 367a9297 |
14 | 213396bb |
15 | 144cd26b |
hex | d1ea1c5 |
220111301 has 4 divisors (see below), whose sum is σ = 222897600. Its totient is φ = 217325004.
The previous prime is 220111277. The next prime is 220111319. The reversal of 220111301 is 103111022.
220111301 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 220111301 - 222 = 215916997 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220111321) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1393031 + ... + 1393188.
It is an arithmetic number, because the mean of its divisors is an integer number (55724400).
Almost surely, 2220111301 is an apocalyptic number.
It is an amenable number.
220111301 is a deficient number, since it is larger than the sum of its proper divisors (2786299).
220111301 is an equidigital number, since it uses as much as digits as its factorization.
220111301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2786298.
The product of its (nonzero) digits is 12, while the sum is 11.
The square root of 220111301 is about 14836.1484557145. The cubic root of 220111301 is about 603.7828600124.
Adding to 220111301 its reverse (103111022), we get a palindrome (323222323).
The spelling of 220111301 in words is "two hundred twenty million, one hundred eleven thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •