Base | Representation |
---|---|
bin | 111100000111011001100… |
… | …110100101101001100001 |
3 | 112121221010110110102210021 |
4 | 330013121212211221201 |
5 | 1020141010232434014 |
6 | 12441450245233441 |
7 | 604314602351653 |
oct | 74073146455141 |
9 | 15557113412707 |
10 | 4131114343009 |
11 | 1352aa5392135 |
12 | 568779a02881 |
13 | 23c740803514 |
14 | 103d387dc6d3 |
15 | 726d6a89624 |
hex | 3c1d99a5a61 |
4131114343009 has 2 divisors, whose sum is σ = 4131114343010. Its totient is φ = 4131114343008.
The previous prime is 4131114342961. The next prime is 4131114343021. The reversal of 4131114343009 is 9003434111314.
4131114343009 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., 4091315290000 + 39799053009 = 2022700^2 + 199497^2 .
It is a cyclic number.
It is not a de Polignac number, because 4131114343009 - 27 = 4131114342881 is a prime.
It is a super-2 number, since 2×41311143430092 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (4131114343409) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2065557171504 + 2065557171505.
It is an arithmetic number, because the mean of its divisors is an integer number (2065557171505).
Almost surely, 24131114343009 is an apocalyptic number.
It is an amenable number.
4131114343009 is a deficient number, since it is larger than the sum of its proper divisors (1).
4131114343009 is an equidigital number, since it uses as much as digits as its factorization.
4131114343009 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15552, while the sum is 34.
The spelling of 4131114343009 in words is "four trillion, one hundred thirty-one billion, one hundred fourteen million, three hundred forty-three thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •