Base | Representation |
---|---|
bin | 111111100010011… |
… | …1110100001111011 |
3 | 12111120202101110020 |
4 | 1333010332201323 |
5 | 13331243324011 |
6 | 551320221523 |
7 | 103555536615 |
oct | 17704764173 |
9 | 5446671406 |
10 | 2132011131 |
11 | 9a4512578 |
12 | 4b600a8a3 |
13 | 27c918363 |
14 | 16321ddb5 |
15 | c728c006 |
hex | 7f13e87b |
2132011131 has 4 divisors (see below), whose sum is σ = 2842681512. Its totient is φ = 1421340752.
The previous prime is 2132011117. The next prime is 2132011139. The reversal of 2132011131 is 1311102312.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2132011131 - 25 = 2132011099 is a prime.
It is a super-2 number, since 2×21320111312 = 9090942925415798322, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2132011131.
It is not an unprimeable number, because it can be changed into a prime (2132011139) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 355335186 + ... + 355335191.
It is an arithmetic number, because the mean of its divisors is an integer number (710670378).
Almost surely, 22132011131 is an apocalyptic number.
2132011131 is a deficient number, since it is larger than the sum of its proper divisors (710670381).
2132011131 is an equidigital number, since it uses as much as digits as its factorization.
2132011131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 710670380.
The product of its (nonzero) digits is 36, while the sum is 15.
The square root of 2132011131 is about 46173.7060565859. The cubic root of 2132011131 is about 1287.0531719449.
Adding to 2132011131 its reverse (1311102312), we get a palindrome (3443113443).
The spelling of 2132011131 in words is "two billion, one hundred thirty-two million, eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •