Base | Representation |
---|---|
bin | 100001101111111… |
… | …0011110011100011 |
3 | 2220220211111102001 |
4 | 1003133303303203 |
5 | 4304344142011 |
6 | 304211304431 |
7 | 40030226044 |
oct | 10337636343 |
9 | 2826744361 |
10 | 1132412131 |
11 | 531242aa4 |
12 | 2772ab117 |
13 | 1507bb866 |
14 | aa5788cb |
15 | 696397c1 |
hex | 437f3ce3 |
1132412131 has 2 divisors, whose sum is σ = 1132412132. Its totient is φ = 1132412130.
The previous prime is 1132412129. The next prime is 1132412167. The reversal of 1132412131 is 1312142311.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1132412131 - 21 = 1132412129 is a prime.
It is a super-2 number, since 2×11324121312 = 2564714468871922322, which contains 22 as substring.
Together with 1132412129, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 1132412099 and 1132412108.
It is not a weakly prime, because it can be changed into another prime (1132412231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 566206065 + 566206066.
It is an arithmetic number, because the mean of its divisors is an integer number (566206066).
Almost surely, 21132412131 is an apocalyptic number.
1132412131 is a deficient number, since it is larger than the sum of its proper divisors (1).
1132412131 is an equidigital number, since it uses as much as digits as its factorization.
1132412131 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 144, while the sum is 19.
The square root of 1132412131 is about 33651.3317864241. The cubic root of 1132412131 is about 1042.3210399254.
Adding to 1132412131 its reverse (1312142311), we get a palindrome (2444554442).
The spelling of 1132412131 in words is "one billion, one hundred thirty-two million, four hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •