Base | Representation |
---|---|
bin | 10101000110101001… |
… | …11010011011101001 |
3 | 1002020121120212110002 |
4 | 22203110322123221 |
5 | 141201001244032 |
6 | 5112135232345 |
7 | 550525200212 |
oct | 124324723351 |
9 | 32217525402 |
10 | 11330103017 |
11 | 4894603102 |
12 | 22425186b5 |
13 | 10b743528c |
14 | 796a7c409 |
15 | 464a47862 |
hex | 2a353a6e9 |
11330103017 has 2 divisors, whose sum is σ = 11330103018. Its totient is φ = 11330103016.
The previous prime is 11330103013. The next prime is 11330103019. The reversal of 11330103017 is 71030103311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10696523776 + 633579241 = 103424^2 + 25171^2 .
It is an emirp because it is prime and its reverse (71030103311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11330103017 - 22 = 11330103013 is a prime.
Together with 11330103019, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11330103017.
It is not a weakly prime, because it can be changed into another prime (11330103013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5665051508 + 5665051509.
It is an arithmetic number, because the mean of its divisors is an integer number (5665051509).
Almost surely, 211330103017 is an apocalyptic number.
It is an amenable number.
11330103017 is a deficient number, since it is larger than the sum of its proper divisors (1).
11330103017 is an equidigital number, since it uses as much as digits as its factorization.
11330103017 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 189, while the sum is 20.
Adding to 11330103017 its reverse (71030103311), we get a palindrome (82360206328).
The spelling of 11330103017 in words is "eleven billion, three hundred thirty million, one hundred three thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •