Base | Representation |
---|---|
bin | 10111110011100100… |
… | …11001100001000101 |
3 | 1012222201002110111201 |
4 | 23321302121201011 |
5 | 202133323014333 |
6 | 5512114102501 |
7 | 631500633406 |
oct | 137162314105 |
9 | 35881073451 |
10 | 12780673093 |
11 | 54693a1951 |
12 | 258827aa31 |
13 | 1288b0b776 |
14 | 8935959ad |
15 | 4ec07b17d |
hex | 2f9c99845 |
12780673093 has 2 divisors, whose sum is σ = 12780673094. Its totient is φ = 12780673092.
The previous prime is 12780673001. The next prime is 12780673111. The reversal of 12780673093 is 39037608721.
It is a happy number.
12780673093 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., 9753142564 + 3027530529 = 98758^2 + 55023^2 .
It is an emirp because it is prime and its reverse (39037608721) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12780673093 - 221 = 12778575941 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12780671093) 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, 6390336546 + 6390336547.
It is an arithmetic number, because the mean of its divisors is an integer number (6390336547).
Almost surely, 212780673093 is an apocalyptic number.
It is an amenable number.
12780673093 is a deficient number, since it is larger than the sum of its proper divisors (1).
12780673093 is an equidigital number, since it uses as much as digits as its factorization.
12780673093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 381024, while the sum is 46.
The spelling of 12780673093 in words is "twelve billion, seven hundred eighty million, six hundred seventy-three thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •