Base | Representation |
---|---|
bin | 10110100110010011… |
… | …00101101111000111 |
3 | 1011022112022212021211 |
4 | 23103021211233013 |
5 | 144321401103111 |
6 | 5323520152251 |
7 | 606440022124 |
oct | 132311455707 |
9 | 34275285254 |
10 | 12132441031 |
11 | 51664a0577 |
12 | 2427168687 |
13 | 11b47263b9 |
14 | 83145574b |
15 | 4b01d2521 |
hex | 2d3265bc7 |
12132441031 has 2 divisors, whose sum is σ = 12132441032. Its totient is φ = 12132441030.
The previous prime is 12132441019. The next prime is 12132441043. The reversal of 12132441031 is 13014423121.
It is a balanced prime because it is at equal distance from previous prime (12132441019) and next prime (12132441043).
It is a cyclic number.
It is not a de Polignac number, because 12132441031 - 213 = 12132432839 is a prime.
It is a super-2 number, since 2×121324410312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12132440993 and 12132441011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12132441001) 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, 6066220515 + 6066220516.
It is an arithmetic number, because the mean of its divisors is an integer number (6066220516).
Almost surely, 212132441031 is an apocalyptic number.
12132441031 is a deficient number, since it is larger than the sum of its proper divisors (1).
12132441031 is an equidigital number, since it uses as much as digits as its factorization.
12132441031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 12132441031 its reverse (13014423121), we get a palindrome (25146864152).
The spelling of 12132441031 in words is "twelve billion, one hundred thirty-two million, four hundred forty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •