Base | Representation |
---|---|
bin | 111011111100011… |
… | …1001101110010001 |
3 | 12012011210222012221 |
4 | 1313320321232101 |
5 | 13104404431301 |
6 | 531331221041 |
7 | 100562443051 |
oct | 16770715621 |
9 | 5164728187 |
10 | 2011405201 |
11 | 942427553 |
12 | 481747781 |
13 | 26093b6c0 |
14 | 1511c7561 |
15 | bb8b6da1 |
hex | 77e39b91 |
2011405201 has 8 divisors (see below), whose sum is σ = 2293548264. Its totient is φ = 1747464960.
The previous prime is 2011405159. The next prime is 2011405219. The reversal of 2011405201 is 1025041102.
It can be written as a sum of positive squares in 4 ways, for example, as 13315201 + 1998090000 = 3649^2 + 44700^2 .
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 2011405201 - 213 = 2011397009 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2011405601) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4550470 + ... + 4550911.
It is an arithmetic number, because the mean of its divisors is an integer number (286693533).
Almost surely, 22011405201 is an apocalyptic number.
It is an amenable number.
2011405201 is a deficient number, since it is larger than the sum of its proper divisors (282143063).
2011405201 is a wasteful number, since it uses less digits than its factorization.
2011405201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9101411.
The product of its (nonzero) digits is 80, while the sum is 16.
The square root of 2011405201 is about 44848.6922997761. The cubic root of 2011405201 is about 1262.3114539333.
Adding to 2011405201 its reverse (1025041102), we get a palindrome (3036446303).
The spelling of 2011405201 in words is "two billion, eleven million, four hundred five thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •