Base | Representation |
---|---|
bin | 1010001100001111000011… |
… | …0001000110110001101001 |
3 | 1110200012212121101020212122 |
4 | 2203003300301012301221 |
5 | 2432041440403100432 |
6 | 35455352241321025 |
7 | 2234362062303122 |
oct | 243036061066151 |
9 | 43605777336778 |
10 | 11205314112617 |
11 | 3630168770619 |
12 | 130b7b9036175 |
13 | 63386c6a1361 |
14 | 2aa4a9323049 |
15 | 146721430612 |
hex | a30f0c46c69 |
11205314112617 has 2 divisors, whose sum is σ = 11205314112618. Its totient is φ = 11205314112616.
The previous prime is 11205314112563. The next prime is 11205314112647. The reversal of 11205314112617 is 71621141350211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10199106508816 + 1006207603801 = 3193604^2 + 1003099^2 .
It is a cyclic number.
It is not a de Polignac number, because 11205314112617 - 242 = 6807267601513 is a prime.
It is not a weakly prime, because it can be changed into another prime (11205314112647) 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, 5602657056308 + 5602657056309.
It is an arithmetic number, because the mean of its divisors is an integer number (5602657056309).
Almost surely, 211205314112617 is an apocalyptic number.
It is an amenable number.
11205314112617 is a deficient number, since it is larger than the sum of its proper divisors (1).
11205314112617 is an equidigital number, since it uses as much as digits as its factorization.
11205314112617 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10080, while the sum is 35.
Adding to 11205314112617 its reverse (71621141350211), we get a palindrome (82826455462828).
The spelling of 11205314112617 in words is "eleven trillion, two hundred five billion, three hundred fourteen million, one hundred twelve thousand, six hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •