Base | Representation |
---|---|
bin | 1000001111001001… |
… | …0111110011101011 |
3 | 12201002102110021001 |
4 | 2003302113303223 |
5 | 14012010120021 |
6 | 1003221455431 |
7 | 105535234324 |
oct | 20362276353 |
9 | 5632373231 |
10 | 2211020011 |
11 | a35077072 |
12 | 518571577 |
13 | 2930bc585 |
14 | 16d90944b |
15 | ce197091 |
hex | 83c97ceb |
2211020011 has 8 divisors (see below), whose sum is σ = 2225793024. Its totient is φ = 2196280680.
The previous prime is 2211019999. The next prime is 2211020023. The reversal of 2211020011 is 1100201122.
It is an interprime number because it is at equal distance from previous prime (2211019999) and next prime (2211020023).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2211020011 - 27 = 2211019883 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2211020011.
It is not an unprimeable number, because it can be changed into a prime (2211020611) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 130896 + ... + 146818.
It is an arithmetic number, because the mean of its divisors is an integer number (278224128).
Almost surely, 22211020011 is an apocalyptic number.
2211020011 is a deficient number, since it is larger than the sum of its proper divisors (14773013).
2211020011 is a wasteful number, since it uses less digits than its factorization.
2211020011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16841.
The product of its (nonzero) digits is 8, while the sum is 10.
The square root of 2211020011 is about 47021.4845682269. The cubic root of 2211020011 is about 1302.7594267629.
Adding to 2211020011 its reverse (1100201122), we get a palindrome (3311221133).
The spelling of 2211020011 in words is "two billion, two hundred eleven million, twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •