Base | Representation |
---|---|
bin | 11000000111001010… |
… | …10001111011010101 |
3 | 1020102011022110021112 |
4 | 30003211101323111 |
5 | 203002410200133 |
6 | 5540304224405 |
7 | 635534511062 |
oct | 140345217325 |
9 | 36364273245 |
10 | 12945006293 |
11 | 554313390a |
12 | 261330b105 |
13 | 12b3b8864b |
14 | 8ab331c69 |
15 | 50b6dc648 |
hex | 303951ed5 |
12945006293 has 2 divisors, whose sum is σ = 12945006294. Its totient is φ = 12945006292.
The previous prime is 12945006247. The next prime is 12945006307. The reversal of 12945006293 is 39260054921.
12945006293 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., 8735332369 + 4209673924 = 93463^2 + 64882^2 .
It is a cyclic number.
It is not a de Polignac number, because 12945006293 - 28 = 12945006037 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12945006293.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12945006593) 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, 6472503146 + 6472503147.
It is an arithmetic number, because the mean of its divisors is an integer number (6472503147).
Almost surely, 212945006293 is an apocalyptic number.
It is an amenable number.
12945006293 is a deficient number, since it is larger than the sum of its proper divisors (1).
12945006293 is an equidigital number, since it uses as much as digits as its factorization.
12945006293 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 116640, while the sum is 41.
The spelling of 12945006293 in words is "twelve billion, nine hundred forty-five million, six thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •