Base | Representation |
---|---|
bin | 111011111100111… |
… | …0010100101000000 |
3 | 12012012020210200002 |
4 | 1313321302211000 |
5 | 13104434404310 |
6 | 531340215132 |
7 | 100564433024 |
oct | 16771624500 |
9 | 5165223602 |
10 | 2011638080 |
11 | 942576511 |
12 | 48183a4a8 |
13 | 2609c06ba |
14 | 151248384 |
15 | bb910da5 |
hex | 77e72940 |
2011638080 has 56 divisors (see below), whose sum is σ = 4797356928. Its totient is φ = 803455488.
The previous prime is 2011638073. The next prime is 2011638113. The reversal of 2011638080 is 808361102.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 228317 + ... + 236963.
It is an arithmetic number, because the mean of its divisors is an integer number (85667088).
Almost surely, 22011638080 is an apocalyptic number.
2011638080 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2011638080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2398678464).
2011638080 is an abundant number, since it is smaller than the sum of its proper divisors (2785718848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2011638080 is an equidigital number, since it uses as much as digits as its factorization.
2011638080 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9391 (or 9381 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 29.
The square root of 2011638080 is about 44851.2884987711. The cubic root of 2011638080 is about 1262.3601685474.
Adding to 2011638080 its reverse (808361102), we get a palindrome (2819999182).
The spelling of 2011638080 in words is "two billion, eleven million, six hundred thirty-eight thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •