Base | Representation |
---|---|
bin | 111101100111001011… |
… | …0011101001100100011 |
3 | 110122111222111211021201 |
4 | 1323032112131030203 |
5 | 4131433104342011 |
6 | 140441032102031 |
7 | 12362535022024 |
oct | 1731626351443 |
9 | 418458454251 |
10 | 132311012131 |
11 | 51127131811 |
12 | 21786834917 |
13 | c62790412c |
14 | 65923a2c4b |
15 | 3695baccc1 |
hex | 1ece59d323 |
132311012131 has 2 divisors, whose sum is σ = 132311012132. Its totient is φ = 132311012130.
The previous prime is 132311012081. The next prime is 132311012143. The reversal of 132311012131 is 131210113231.
It is a strong prime.
It is an emirp because it is prime and its reverse (131210113231) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 132311012131 - 213 = 132311003939 is a prime.
It is a super-2 number, since 2×1323110121312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 132311012099 and 132311012108.
It is not a weakly prime, because it can be changed into another prime (132311012191) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66155506065 + 66155506066.
It is an arithmetic number, because the mean of its divisors is an integer number (66155506066).
Almost surely, 2132311012131 is an apocalyptic number.
132311012131 is a deficient number, since it is larger than the sum of its proper divisors (1).
132311012131 is an equidigital number, since it uses as much as digits as its factorization.
132311012131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 132311012131 its reverse (131210113231), we get a palindrome (263521125362).
The spelling of 132311012131 in words is "one hundred thirty-two billion, three hundred eleven million, twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •