Base | Representation |
---|---|
bin | 10110011011101010… |
… | …01100110100011101 |
3 | 1011002022102110100022 |
4 | 23031311030310131 |
5 | 144131030210023 |
6 | 5311011441525 |
7 | 604304411312 |
oct | 131565146435 |
9 | 34068373308 |
10 | 12043210013 |
11 | 5120094a2a |
12 | 24012b62a5 |
13 | 119c0b3493 |
14 | 823668d09 |
15 | 4a74587c8 |
hex | 2cdd4cd1d |
12043210013 has 2 divisors, whose sum is σ = 12043210014. Its totient is φ = 12043210012.
The previous prime is 12043209991. The next prime is 12043210027. The reversal of 12043210013 is 31001234021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10477979044 + 1565230969 = 102362^2 + 39563^2 .
It is a cyclic number.
It is not a de Polignac number, because 12043210013 - 220 = 12042161437 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 12043209973 and 12043210000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12043210033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6021605006 + 6021605007.
It is an arithmetic number, because the mean of its divisors is an integer number (6021605007).
Almost surely, 212043210013 is an apocalyptic number.
It is an amenable number.
12043210013 is a deficient number, since it is larger than the sum of its proper divisors (1).
12043210013 is an equidigital number, since it uses as much as digits as its factorization.
12043210013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 12043210013 its reverse (31001234021), we get a palindrome (43044444034).
The spelling of 12043210013 in words is "twelve billion, forty-three million, two hundred ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •