Base | Representation |
---|---|
bin | 10110111100110110… |
… | …11000000000110101 |
3 | 1011210201100211000201 |
4 | 23132123120000311 |
5 | 200213320342124 |
6 | 5354355440501 |
7 | 614225214655 |
oct | 133633300065 |
9 | 34721324021 |
10 | 12321652789 |
11 | 5253285126 |
12 | 247a5b6131 |
13 | 12149a4114 |
14 | 84c62a365 |
15 | 4c1b0a144 |
hex | 2de6d8035 |
12321652789 has 2 divisors, whose sum is σ = 12321652790. Its totient is φ = 12321652788.
The previous prime is 12321652753. The next prime is 12321652823. The reversal of 12321652789 is 98725612321.
12321652789 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., 8979078564 + 3342574225 = 94758^2 + 57815^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12321652789 is a prime.
It is an alternating number because its digits alternate between odd and even.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12321652729) 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, 6160826394 + 6160826395.
It is an arithmetic number, because the mean of its divisors is an integer number (6160826395).
Almost surely, 212321652789 is an apocalyptic number.
It is an amenable number.
12321652789 is a deficient number, since it is larger than the sum of its proper divisors (1).
12321652789 is an equidigital number, since it uses as much as digits as its factorization.
12321652789 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 362880, while the sum is 46.
The spelling of 12321652789 in words is "twelve billion, three hundred twenty-one million, six hundred fifty-two thousand, seven hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •