Base | Representation |
---|---|
bin | 11101111001111110… |
… | …111011110100000011 |
3 | 10001212220002200010201 |
4 | 131321332323310003 |
5 | 1011230443442011 |
6 | 22430212510031 |
7 | 2214514435543 |
oct | 357176736403 |
9 | 101786080121 |
10 | 32111312131 |
11 | 12688aa9098 |
12 | 628201b317 |
13 | 3049913b12 |
14 | 17a89db323 |
15 | c7e177cc1 |
hex | 779fbbd03 |
32111312131 has 2 divisors, whose sum is σ = 32111312132. Its totient is φ = 32111312130.
The previous prime is 32111312029. The next prime is 32111312153. The reversal of 32111312131 is 13121311123.
It is a strong prime.
It is an emirp because it is prime and its reverse (13121311123) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 32111312131 - 27 = 32111312003 is a prime.
It is a super-3 number, since 3×321113121313 (a number of 32 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 32111312099 and 32111312108.
It is not a weakly prime, because it can be changed into another prime (32111310131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16055656065 + 16055656066.
It is an arithmetic number, because the mean of its divisors is an integer number (16055656066).
Almost surely, 232111312131 is an apocalyptic number.
32111312131 is a deficient number, since it is larger than the sum of its proper divisors (1).
32111312131 is an equidigital number, since it uses as much as digits as its factorization.
32111312131 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 108, while the sum is 19.
Adding to 32111312131 its reverse (13121311123), we get a palindrome (45232623254).
The spelling of 32111312131 in words is "thirty-two billion, one hundred eleven million, three hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •