Base | Representation |
---|---|
bin | 11010001110100… |
… | …01101001011101 |
3 | 120022222201111022 |
4 | 31013101221131 |
5 | 422310323401 |
6 | 33455333525 |
7 | 5311030532 |
oct | 1507215135 |
9 | 508881438 |
10 | 220011101 |
11 | 103210662 |
12 | 618212a5 |
13 | 367727ab |
14 | 21310d89 |
15 | 144ad71b |
hex | d1d1a5d |
220011101 has 4 divisors (see below), whose sum is σ = 220406652. Its totient is φ = 219615552.
The previous prime is 220011097. The next prime is 220011107. The reversal of 220011101 is 101110022.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 92659876 + 127351225 = 9626^2 + 11285^2 .
It is a cyclic number.
It is not a de Polignac number, because 220011101 - 22 = 220011097 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220011107) 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, 196940 + ... + 198053.
It is an arithmetic number, because the mean of its divisors is an integer number (55101663).
Almost surely, 2220011101 is an apocalyptic number.
It is an amenable number.
220011101 is a deficient number, since it is larger than the sum of its proper divisors (395551).
220011101 is an equidigital number, since it uses as much as digits as its factorization.
220011101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 395550.
The product of its (nonzero) digits is 4, while the sum is 8.
The square root of 220011101 is about 14832.7711841045. The cubic root of 220011101 is about 603.6912272417.
Adding to 220011101 its reverse (101110022), we get a palindrome (321121123).
It can be divided in two parts, 220011 and 101, that multiplied together give a triangular number (22221111 = T6666).
The spelling of 220011101 in words is "two hundred twenty million, eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •