Base | Representation |
---|---|
bin | 10111000111111001… |
… | …00101001001100111 |
3 | 1012001011120220111202 |
4 | 23203330211021213 |
5 | 200411021242211 |
6 | 5411504153115 |
7 | 616431220352 |
oct | 134374451147 |
9 | 35034526452 |
10 | 12414243431 |
11 | 52a0575917 |
12 | 24a560879b |
13 | 122ac22295 |
14 | 85aa4d299 |
15 | 4c9ce953b |
hex | 2e3f25267 |
12414243431 has 2 divisors, whose sum is σ = 12414243432. Its totient is φ = 12414243430.
The previous prime is 12414243397. The next prime is 12414243437. The reversal of 12414243431 is 13434241421.
It is a strong prime.
It is an emirp because it is prime and its reverse (13434241421) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12414243431 - 218 = 12413981287 is a prime.
It is a super-2 number, since 2×124142434312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12414243394 and 12414243403.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12414243437) 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, 6207121715 + 6207121716.
It is an arithmetic number, because the mean of its divisors is an integer number (6207121716).
Almost surely, 212414243431 is an apocalyptic number.
12414243431 is a deficient number, since it is larger than the sum of its proper divisors (1).
12414243431 is an equidigital number, since it uses as much as digits as its factorization.
12414243431 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 9216, while the sum is 29.
Adding to 12414243431 its reverse (13434241421), we get a palindrome (25848484852).
The spelling of 12414243431 in words is "twelve billion, four hundred fourteen million, two hundred forty-three thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •