Base | Representation |
---|---|
bin | 1100010010100001100… |
… | …0110110110010010000 |
3 | 202011222002020011200202 |
4 | 3010220120312302100 |
5 | 11424344014031000 |
6 | 240554154034332 |
7 | 21153010622612 |
oct | 3045030666220 |
9 | 664862204622 |
10 | 211131002000 |
11 | 815a3a45806 |
12 | 34b034189a8 |
13 | 16ba94233a9 |
14 | a30c532db2 |
15 | 575a78ddd5 |
hex | 3128636c90 |
211131002000 has 80 divisors (see below), whose sum is σ = 537384057600. Its totient is φ = 80007523200.
The previous prime is 211131001997. The next prime is 211131002003. The reversal of 211131002000 is 200131112.
It is an interprime number because it is at equal distance from previous prime (211131001997) and next prime (211131002003).
It is a tau number, because it is divible by the number of its divisors (80).
It is not an unprimeable number, because it can be changed into a prime (211131002003) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2740040 + ... + 2816039.
It is an arithmetic number, because the mean of its divisors is an integer number (6717300720).
Almost surely, 2211131002000 is an apocalyptic number.
211131002000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
211131002000 is an abundant number, since it is smaller than the sum of its proper divisors (326253055600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211131002000 is a wasteful number, since it uses less digits than its factorization.
211131002000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5556121 (or 5556105 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 211131002000 its reverse (200131112), we get a palindrome (211331133112).
The spelling of 211131002000 in words is "two hundred eleven billion, one hundred thirty-one million, two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •