Base | Representation |
---|---|
bin | 10111100010111100… |
… | …00001101110001111 |
3 | 1012121222111011211022 |
4 | 23301132001232033 |
5 | 201342111140043 |
6 | 5450210544355 |
7 | 625154463515 |
oct | 136136015617 |
9 | 35558434738 |
10 | 12641115023 |
11 | 53a76418a9 |
12 | 25495980bb |
13 | 1265c27624 |
14 | 87cc284b5 |
15 | 4debb0868 |
hex | 2f1781b8f |
12641115023 has 2 divisors, whose sum is σ = 12641115024. Its totient is φ = 12641115022.
The previous prime is 12641115001. The next prime is 12641115041. The reversal of 12641115023 is 32051114621.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 12641115023 - 28 = 12641114767 is a prime.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 12641114983 and 12641115001.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12641115043) 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, 6320557511 + 6320557512.
It is an arithmetic number, because the mean of its divisors is an integer number (6320557512).
Almost surely, 212641115023 is an apocalyptic number.
12641115023 is a deficient number, since it is larger than the sum of its proper divisors (1).
12641115023 is an equidigital number, since it uses as much as digits as its factorization.
12641115023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1440, while the sum is 26.
Adding to 12641115023 its reverse (32051114621), we get a palindrome (44692229644).
The spelling of 12641115023 in words is "twelve billion, six hundred forty-one million, one hundred fifteen thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •