Base | Representation |
---|---|
bin | 100011000101110011010… |
… | …111010000100011011101 |
3 | 22112112021110100111021212 |
4 | 203011303113100203131 |
5 | 304002033001130023 |
6 | 5043442030434205 |
7 | 336135016624115 |
oct | 43056327204335 |
9 | 8475243314255 |
10 | 2411412130013 |
11 | 84a746311397 |
12 | 32b421062965 |
13 | 14651a2c7863 |
14 | 849da564045 |
15 | 42ad6722e78 |
hex | 231735d08dd |
2411412130013 has 2 divisors, whose sum is σ = 2411412130014. Its totient is φ = 2411412130012.
The previous prime is 2411412130009. The next prime is 2411412130037. The reversal of 2411412130013 is 3100312141142.
2411412130013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1281702487129 + 1129709642884 = 1132123^2 + 1062878^2 .
It is a cyclic number.
It is not a de Polignac number, because 2411412130013 - 22 = 2411412130009 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2411412130003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1205706065006 + 1205706065007.
It is an arithmetic number, because the mean of its divisors is an integer number (1205706065007).
Almost surely, 22411412130013 is an apocalyptic number.
It is an amenable number.
2411412130013 is a deficient number, since it is larger than the sum of its proper divisors (1).
2411412130013 is an equidigital number, since it uses as much as digits as its factorization.
2411412130013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 2411412130013 its reverse (3100312141142), we get a palindrome (5511724271155).
The spelling of 2411412130013 in words is "two trillion, four hundred eleven billion, four hundred twelve million, one hundred thirty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •