Base | Representation |
---|---|
bin | 10101011001110000… |
… | …00010011111111001 |
3 | 1002122210001000200102 |
4 | 22230320002133321 |
5 | 142013004243131 |
6 | 5140101045145 |
7 | 554511663344 |
oct | 125470023771 |
9 | 32583030612 |
10 | 11490306041 |
11 | 4966a83aa5 |
12 | 22880b67b5 |
13 | 1111697276 |
14 | 7b006145b |
15 | 473b401cb |
hex | 2ace027f9 |
11490306041 has 2 divisors, whose sum is σ = 11490306042. Its totient is φ = 11490306040.
The previous prime is 11490306013. The next prime is 11490306043. The reversal of 11490306041 is 14060309411.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9374306041 + 2116000000 = 96821^2 + 46000^2 .
It is a cyclic number.
It is not a de Polignac number, because 11490306041 - 26 = 11490305977 is a prime.
Together with 11490306043, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 11490305995 and 11490306013.
It is not a weakly prime, because it can be changed into another prime (11490306043) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5745153020 + 5745153021.
It is an arithmetic number, because the mean of its divisors is an integer number (5745153021).
Almost surely, 211490306041 is an apocalyptic number.
It is an amenable number.
11490306041 is a deficient number, since it is larger than the sum of its proper divisors (1).
11490306041 is an equidigital number, since it uses as much as digits as its factorization.
11490306041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2592, while the sum is 29.
The spelling of 11490306041 in words is "eleven billion, four hundred ninety million, three hundred six thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •