Base | Representation |
---|---|
bin | 10111011010010000… |
… | …11000100111010101 |
3 | 1012102220112110022211 |
4 | 23231020120213111 |
5 | 201214443122012 |
6 | 5435050553421 |
7 | 623312031361 |
oct | 135510304725 |
9 | 35386473284 |
10 | 12568332757 |
11 | 536a550472 |
12 | 2529138871 |
13 | 1253b235b6 |
14 | 8732c02a1 |
15 | 4d85d56a7 |
hex | 2ed2189d5 |
12568332757 has 2 divisors, whose sum is σ = 12568332758. Its totient is φ = 12568332756.
The previous prime is 12568332739. The next prime is 12568332761. The reversal of 12568332757 is 75723386521.
12568332757 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., 8301760996 + 4266571761 = 91114^2 + 65319^2 .
It is a cyclic number.
It is not a de Polignac number, because 12568332757 - 219 = 12567808469 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12568332757.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12568332737) 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, 6284166378 + 6284166379.
It is an arithmetic number, because the mean of its divisors is an integer number (6284166379).
Almost surely, 212568332757 is an apocalyptic number.
It is an amenable number.
12568332757 is a deficient number, since it is larger than the sum of its proper divisors (1).
12568332757 is an equidigital number, since it uses as much as digits as its factorization.
12568332757 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2116800, while the sum is 49.
The spelling of 12568332757 in words is "twelve billion, five hundred sixty-eight million, three hundred thirty-two thousand, seven hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •