Base | Representation |
---|---|
bin | 11101110100000100… |
… | …000110001101010011 |
3 | 10001121222020012102120 |
4 | 131310010012031103 |
5 | 1011030033032011 |
6 | 22412304145323 |
7 | 2212200346164 |
oct | 356404061523 |
9 | 101558205376 |
10 | 32012002131 |
11 | 12637a3900a |
12 | 6254908243 |
13 | 30321823c5 |
14 | 179974976b |
15 | c755aca06 |
hex | 774106353 |
32012002131 has 8 divisors (see below), whose sum is σ = 42684252624. Its totient is φ = 21340543200.
The previous prime is 32012002109. The next prime is 32012002153. The reversal of 32012002131 is 13120021023.
It is an interprime number because it is at equal distance from previous prime (32012002109) and next prime (32012002153).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 32012002131 - 27 = 32012002003 is a prime.
It is a super-2 number, since 2×320120021312 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 32012002131.
It is not an unprimeable number, because it can be changed into a prime (32012002931) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 96036 + ... + 270641.
It is an arithmetic number, because the mean of its divisors is an integer number (5335531578).
Almost surely, 232012002131 is an apocalyptic number.
32012002131 is a deficient number, since it is larger than the sum of its proper divisors (10672250493).
32012002131 is a wasteful number, since it uses less digits than its factorization.
32012002131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 395781.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 32012002131 its reverse (13120021023), we get a palindrome (45132023154).
The spelling of 32012002131 in words is "thirty-two billion, twelve million, two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •