Base | Representation |
---|---|
bin | 111011111001111… |
… | …1101110010011100 |
3 | 12012002101020002110 |
4 | 1313303331302130 |
5 | 13104042024012 |
6 | 531243354020 |
7 | 100545443211 |
oct | 16763756234 |
9 | 5162336073 |
10 | 2010111132 |
11 | 941723277 |
12 | 481222910 |
13 | 2605a7693 |
14 | 150d6bb08 |
15 | bb70d73c |
hex | 77cfdc9c |
2010111132 has 12 divisors (see below), whose sum is σ = 4690259336. Its totient is φ = 670037040.
The previous prime is 2010111121. The next prime is 2010111143. The reversal of 2010111132 is 2311110102.
It is an interprime number because it is at equal distance from previous prime (2010111121) and next prime (2010111143).
It is a tau number, because it is divible by the number of its divisors (12).
It is a Harshad number since it is a multiple of its sum of digits (12), and also a Moran number because the ratio is a prime number: 167509261 = 2010111132 / (2 + 0 + 1 + 0 + 1 + 1 + 1 + 1 + 3 + 2).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 83754619 + ... + 83754642.
Almost surely, 22010111132 is an apocalyptic number.
It is an amenable number.
2010111132 is an abundant number, since it is smaller than the sum of its proper divisors (2680148204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2010111132 is a wasteful number, since it uses less digits than its factorization.
2010111132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 167509268 (or 167509266 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 12.
The square root of 2010111132 is about 44834.2629246874. The cubic root of 2010111132 is about 1262.0406865842.
Adding to 2010111132 its reverse (2311110102), we get a palindrome (4321221234).
The spelling of 2010111132 in words is "two billion, ten million, one hundred eleven thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •