Base | Representation |
---|---|
bin | 10111001101100001… |
… | …00111011000110001 |
3 | 1012011110101122222202 |
4 | 23212300213120301 |
5 | 201010112013023 |
6 | 5420311512545 |
7 | 620543323346 |
oct | 134660473061 |
9 | 35143348882 |
10 | 12461438513 |
11 | 5315180217 |
12 | 24b9388755 |
13 | 1237937a74 |
14 | 8630167cd |
15 | 4ce01d128 |
hex | 2e6c27631 |
12461438513 has 2 divisors, whose sum is σ = 12461438514. Its totient is φ = 12461438512.
The previous prime is 12461438503. The next prime is 12461438531. The reversal of 12461438513 is 31583416421.
12461438513 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
Together with next prime (12461438531) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7401677089 + 5059761424 = 86033^2 + 71132^2 .
It is a cyclic number.
It is not a de Polignac number, because 12461438513 - 26 = 12461438449 is a prime.
It is not a weakly prime, because it can be changed into another prime (12461438503) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6230719256 + 6230719257.
It is an arithmetic number, because the mean of its divisors is an integer number (6230719257).
Almost surely, 212461438513 is an apocalyptic number.
It is an amenable number.
12461438513 is a deficient number, since it is larger than the sum of its proper divisors (1).
12461438513 is an equidigital number, since it uses as much as digits as its factorization.
12461438513 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 69120, while the sum is 38.
The spelling of 12461438513 in words is "twelve billion, four hundred sixty-one million, four hundred thirty-eight thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •