Base | Representation |
---|---|
bin | 10111111011000110… |
… | …00010100001100101 |
3 | 1020011002210101110122 |
4 | 23331203002201211 |
5 | 202301000134441 |
6 | 5522250131325 |
7 | 633165056444 |
oct | 137543024145 |
9 | 36132711418 |
10 | 12843755621 |
11 | 54a0a68774 |
12 | 25a5420b45 |
13 | 1298bc77c8 |
14 | 89bad6d5b |
15 | 50288c34b |
hex | 2fd8c2865 |
12843755621 has 2 divisors, whose sum is σ = 12843755622. Its totient is φ = 12843755620.
The previous prime is 12843755599. The next prime is 12843755623. The reversal of 12843755621 is 12655734821.
12843755621 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., 11905864996 + 937890625 = 109114^2 + 30625^2 .
It is a cyclic number.
It is not a de Polignac number, because 12843755621 - 210 = 12843754597 is a prime.
Together with 12843755623, 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 (12843755623) 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, 6421877810 + 6421877811.
It is an arithmetic number, because the mean of its divisors is an integer number (6421877811).
Almost surely, 212843755621 is an apocalyptic number.
It is an amenable number.
12843755621 is a deficient number, since it is larger than the sum of its proper divisors (1).
12843755621 is an equidigital number, since it uses as much as digits as its factorization.
12843755621 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 403200, while the sum is 44.
The spelling of 12843755621 in words is "twelve billion, eight hundred forty-three million, seven hundred fifty-five thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •