Base | Representation |
---|---|
bin | 1011101010110001… |
… | …1100001110010001 |
3 | 22002021210212021001 |
4 | 2322230130032101 |
5 | 22403321241423 |
6 | 1234450102001 |
7 | 140422235512 |
oct | 27254341621 |
9 | 8067725231 |
10 | 3132212113 |
11 | 1368063358 |
12 | 734b7a901 |
13 | 3abbc5b64 |
14 | 219dc0a09 |
15 | 134eaccad |
hex | bab1c391 |
3132212113 has 2 divisors, whose sum is σ = 3132212114. Its totient is φ = 3132212112.
The previous prime is 3132212099. The next prime is 3132212129. The reversal of 3132212113 is 3112122313.
3132212113 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3121792129 + 10419984 = 55873^2 + 3228^2 .
It is an emirp because it is prime and its reverse (3112122313) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3132212113 - 29 = 3132211601 is a prime.
It is not a weakly prime, because it can be changed into another prime (3132212143) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1566106056 + 1566106057.
It is an arithmetic number, because the mean of its divisors is an integer number (1566106057).
Almost surely, 23132212113 is an apocalyptic number.
It is an amenable number.
3132212113 is a deficient number, since it is larger than the sum of its proper divisors (1).
3132212113 is an equidigital number, since it uses as much as digits as its factorization.
3132212113 is an evil number, because the sum of its binary digits is even.
The product of its digits is 216, while the sum is 19.
The square root of 3132212113 is about 55966.1693614991. The cubic root of 3132212113 is about 1463.1327167871.
Adding to 3132212113 its reverse (3112122313), we get a palindrome (6244334426).
The spelling of 3132212113 in words is "three billion, one hundred thirty-two million, two hundred twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •