Base | Representation |
---|---|
bin | 11010001110100… |
… | …01011000011011 |
3 | 120022222122222221 |
4 | 31013101120123 |
5 | 422310310021 |
6 | 33455324511 |
7 | 5311024414 |
oct | 1507213033 |
9 | 508878887 |
10 | 220010011 |
11 | 10320a861 |
12 | 61820737 |
13 | 36772150 |
14 | 2131080b |
15 | 144ad241 |
hex | d1d161b |
220010011 has 4 divisors (see below), whose sum is σ = 236933872. Its totient is φ = 203086152.
The previous prime is 220009963. The next prime is 220010033. The reversal of 220010011 is 110010022.
220010011 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 an emirpimes, since its reverse is a distinct semiprime: 110010022 = 2 ⋅55005011.
It is a cyclic number.
It is not a de Polignac number, because 220010011 - 29 = 220009499 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 220009976 and 220010003.
It is not an unprimeable number, because it can be changed into a prime (220010041) 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, 8461911 + ... + 8461936.
It is an arithmetic number, because the mean of its divisors is an integer number (59233468).
Almost surely, 2220010011 is an apocalyptic number.
220010011 is a deficient number, since it is larger than the sum of its proper divisors (16923861).
220010011 is a wasteful number, since it uses less digits than its factorization.
220010011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16923860.
The product of its (nonzero) digits is 4, while the sum is 7.
The square root of 220010011 is about 14832.7344410935. The cubic root of 220010011 is about 603.6902302852.
Adding to 220010011 its reverse (110010022), we get a palindrome (330020033).
The spelling of 220010011 in words is "two hundred twenty million, ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •