Base | Representation |
---|---|
bin | 10111001000101111… |
… | …00011001110010111 |
3 | 1012001122220002201121 |
4 | 23210113203032113 |
5 | 200414324012211 |
6 | 5412315504411 |
7 | 616545264532 |
oct | 134427431627 |
9 | 35048802647 |
10 | 12421313431 |
11 | 52a456469a |
12 | 24a7a58107 |
13 | 122c529307 |
14 | 85b96da19 |
15 | 4ca744271 |
hex | 2e45e3397 |
12421313431 has 2 divisors, whose sum is σ = 12421313432. Its totient is φ = 12421313430.
The previous prime is 12421313417. The next prime is 12421313459. The reversal of 12421313431 is 13431312421.
It is a weak prime.
It is an emirp because it is prime and its reverse (13431312421) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12421313431 - 29 = 12421312919 is a prime.
It is a super-2 number, since 2×124213134312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12421313396 and 12421313405.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12421313131) 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, 6210656715 + 6210656716.
It is an arithmetic number, because the mean of its divisors is an integer number (6210656716).
Almost surely, 212421313431 is an apocalyptic number.
12421313431 is a deficient number, since it is larger than the sum of its proper divisors (1).
12421313431 is an equidigital number, since it uses as much as digits as its factorization.
12421313431 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1728, while the sum is 25.
Adding to 12421313431 its reverse (13431312421), we get a palindrome (25852625852).
The spelling of 12421313431 in words is "twelve billion, four hundred twenty-one million, three hundred thirteen thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •