Base | Representation |
---|---|
bin | 10110111101000001… |
… | …10000110010011101 |
3 | 1011210211000120012102 |
4 | 23132200300302131 |
5 | 200214201034424 |
6 | 5354450014445 |
7 | 614243216114 |
oct | 133640606235 |
9 | 34724016172 |
10 | 12323064989 |
11 | 525405a134 |
12 | 247ab77425 |
13 | 1215079b41 |
14 | 84c8b6c7b |
15 | 4c1cd87ae |
hex | 2de830c9d |
12323064989 has 2 divisors, whose sum is σ = 12323064990. Its totient is φ = 12323064988.
The previous prime is 12323064953. The next prime is 12323064991. The reversal of 12323064989 is 98946032321.
12323064989 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., 10848888964 + 1474176025 = 104158^2 + 38395^2 .
It is a cyclic number.
It is not a de Polignac number, because 12323064989 - 216 = 12322999453 is a prime.
Together with 12323064991, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12323067989) 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, 6161532494 + 6161532495.
It is an arithmetic number, because the mean of its divisors is an integer number (6161532495).
Almost surely, 212323064989 is an apocalyptic number.
It is an amenable number.
12323064989 is a deficient number, since it is larger than the sum of its proper divisors (1).
12323064989 is an equidigital number, since it uses as much as digits as its factorization.
12323064989 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 559872, while the sum is 47.
The spelling of 12323064989 in words is "twelve billion, three hundred twenty-three million, sixty-four thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •