Base | Representation |
---|---|
bin | 1100010011010001010… |
… | …0100011110001010011 |
3 | 202012111000221101122102 |
4 | 3010310110203301103 |
5 | 11430301241432011 |
6 | 241030105031015 |
7 | 21160661402510 |
oct | 3046424436123 |
9 | 665430841572 |
10 | 211331202131 |
11 | 81696a55065 |
12 | 34b5a48546b |
13 | 16c0ba4a7ca |
14 | a32ad68307 |
15 | 576d13773b |
hex | 3134523c53 |
211331202131 has 8 divisors (see below), whose sum is σ = 254233025280. Its totient is φ = 171607291848.
The previous prime is 211331202037. The next prime is 211331202163. The reversal of 211331202131 is 131202133112.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 211331202131 - 218 = 211330939987 is a prime.
It is a super-2 number, since 2×2113312021312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (211331202191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 794478071 + ... + 794478336.
It is an arithmetic number, because the mean of its divisors is an integer number (31779128160).
Almost surely, 2211331202131 is an apocalyptic number.
211331202131 is a deficient number, since it is larger than the sum of its proper divisors (42901823149).
211331202131 is a wasteful number, since it uses less digits than its factorization.
211331202131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1588956433.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 211331202131 its reverse (131202133112), we get a palindrome (342533335243).
The spelling of 211331202131 in words is "two hundred eleven billion, three hundred thirty-one million, two hundred two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •