Base | Representation |
---|---|
bin | 10111101111100000… |
… | …01100000011001101 |
3 | 1012220022212021121221 |
4 | 23313300030003031 |
5 | 202101103223323 |
6 | 5504454323341 |
7 | 630604536622 |
oct | 136760140315 |
9 | 35808767557 |
10 | 12746539213 |
11 | 54510a8631 |
12 | 2578959551 |
13 | 1281a19cc5 |
14 | 88cc2c349 |
15 | 4e908755d |
hex | 2f7c0c0cd |
12746539213 has 2 divisors, whose sum is σ = 12746539214. Its totient is φ = 12746539212.
The previous prime is 12746539129. The next prime is 12746539249. The reversal of 12746539213 is 31293564721.
12746539213 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9017971369 + 3728567844 = 94963^2 + 61062^2 .
It is a cyclic number.
It is not a de Polignac number, because 12746539213 - 229 = 12209668301 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12746539213.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12746579213) 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, 6373269606 + 6373269607.
It is an arithmetic number, because the mean of its divisors is an integer number (6373269607).
Almost surely, 212746539213 is an apocalyptic number.
It is an amenable number.
12746539213 is a deficient number, since it is larger than the sum of its proper divisors (1).
12746539213 is an equidigital number, since it uses as much as digits as its factorization.
12746539213 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 272160, while the sum is 43.
The spelling of 12746539213 in words is "twelve billion, seven hundred forty-six million, five hundred thirty-nine thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •