Base | Representation |
---|---|
bin | 111011111100101… |
… | …0101110001010010 |
3 | 12012012000210210210 |
4 | 1313321111301102 |
5 | 13104422120312 |
6 | 531333504550 |
7 | 100563432015 |
oct | 16771256122 |
9 | 5165023723 |
10 | 2011520082 |
11 | 9424a58a0 |
12 | 4817a2156 |
13 | 26097ba90 |
14 | 15121737c |
15 | bb8dae3c |
hex | 77e55c52 |
2011520082 has 128 divisors (see below), whose sum is σ = 5012259840. Its totient is φ = 529079040.
The previous prime is 2011520057. The next prime is 2011520089. The reversal of 2011520082 is 2800251102.
It is a happy number.
It is not an unprimeable number, because it can be changed into a prime (2011520089) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 2656848 + ... + 2657604.
It is an arithmetic number, because the mean of its divisors is an integer number (39158280).
Almost surely, 22011520082 is an apocalyptic number.
2011520082 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 2011520082, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2506129920).
2011520082 is an abundant number, since it is smaller than the sum of its proper divisors (3000739758).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2011520082 is a wasteful number, since it uses less digits than its factorization.
2011520082 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 968.
The product of its (nonzero) digits is 320, while the sum is 21.
The square root of 2011520082 is about 44849.9730434702. The cubic root of 2011520082 is about 1262.3354856966.
Adding to 2011520082 its reverse (2800251102), we get a palindrome (4811771184).
The spelling of 2011520082 in words is "two billion, eleven million, five hundred twenty thousand, eighty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •