Base | Representation |
---|---|
bin | 111011111100000… |
… | …1010000100010000 |
3 | 12012011110001110021 |
4 | 1313320022010100 |
5 | 13104332210000 |
6 | 531323113224 |
7 | 100561001002 |
oct | 16770120420 |
9 | 5164401407 |
10 | 2011210000 |
11 | 942303928 |
12 | 481672814 |
13 | 2608a08b7 |
14 | 151176372 |
15 | bb87911a |
hex | 77e0a110 |
2011210000 has 50 divisors (see below), whose sum is σ = 4869364742. Its totient is φ = 804480000.
The previous prime is 2011209997. The next prime is 2011210009. The reversal of 2011210000 is 121102.
It can be written as a sum of positive squares in 5 ways, for example, as 496754944 + 1514455056 = 22288^2 + 38916^2 .
It is a tau number, because it is divible by the number of its divisors (50).
It is not an unprimeable number, because it can be changed into a prime (2011210009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 90561 + ... + 110560.
Almost surely, 22011210000 is an apocalyptic number.
2011210000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2011210000 is an abundant number, since it is smaller than the sum of its proper divisors (2858154742).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2011210000 is an equidigital number, since it uses as much as digits as its factorization.
2011210000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 201149 (or 201128 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 7.
The square root of 2011210000 is about 44846.5160296762. The cubic root of 2011210000 is about 1262.2706180657.
Adding to 2011210000 its reverse (121102), we get a palindrome (2011331102).
The spelling of 2011210000 in words is "two billion, eleven million, two hundred ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •