Base | Representation |
---|---|
bin | 1000001100110010… |
… | …0111100011000011 |
3 | 12200101210122010111 |
4 | 2003030213203003 |
5 | 14001441414021 |
6 | 1002225412151 |
7 | 105355144153 |
oct | 20314474303 |
9 | 5611718114 |
10 | 2201123011 |
11 | a2a52732a |
12 | 51519a057 |
13 | 291035869 |
14 | 16c490763 |
15 | cd38e8e1 |
hex | 833278c3 |
2201123011 has 4 divisors (see below), whose sum is σ = 2202229432. Its totient is φ = 2200016592.
The previous prime is 2201123009. The next prime is 2201123027. The reversal of 2201123011 is 1103211022.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2201123011 - 21 = 2201123009 is a prime.
It is a super-3 number, since 3×22011230113 (a number of 29 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2201122982 and 2201123000.
It is not an unprimeable number, because it can be changed into a prime (2201123051) 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, 550221 + ... + 554206.
It is an arithmetic number, because the mean of its divisors is an integer number (550557358).
Almost surely, 22201123011 is an apocalyptic number.
2201123011 is a deficient number, since it is larger than the sum of its proper divisors (1106421).
2201123011 is a wasteful number, since it uses less digits than its factorization.
2201123011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1106420.
The product of its (nonzero) digits is 24, while the sum is 13.
The square root of 2201123011 is about 46916.1274083870. The cubic root of 2201123011 is about 1300.8127089801.
Adding to 2201123011 its reverse (1103211022), we get a palindrome (3304334033).
The spelling of 2201123011 in words is "two billion, two hundred one million, one hundred twenty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •