Base | Representation |
---|---|
bin | 10111000100111011… |
… | …00110100101001001 |
3 | 1011222102201222010012 |
4 | 23202131212211021 |
5 | 200333133024414 |
6 | 5405214401305 |
7 | 616006462064 |
oct | 134235464511 |
9 | 34872658105 |
10 | 12389345609 |
11 | 528850a803 |
12 | 2499200235 |
13 | 1225a15744 |
14 | 85760b8db |
15 | 4c7a2c33e |
hex | 2e2766949 |
12389345609 has 2 divisors, whose sum is σ = 12389345610. Its totient is φ = 12389345608.
The previous prime is 12389345603. The next prime is 12389345611. The reversal of 12389345609 is 90654398321.
It is a happy number.
12389345609 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., 7158006025 + 5231339584 = 84605^2 + 72328^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12389345609 is a prime.
Together with 12389345611, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (12389345603) 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, 6194672804 + 6194672805.
It is an arithmetic number, because the mean of its divisors is an integer number (6194672805).
Almost surely, 212389345609 is an apocalyptic number.
It is an amenable number.
12389345609 is a deficient number, since it is larger than the sum of its proper divisors (1).
12389345609 is an equidigital number, since it uses as much as digits as its factorization.
12389345609 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1399680, while the sum is 50.
The spelling of 12389345609 in words is "twelve billion, three hundred eighty-nine million, three hundred forty-five thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •