Base | Representation |
---|---|
bin | 10100110111100010… |
… | …10000101001011101 |
3 | 1001220210000102210101 |
4 | 22123301100221131 |
5 | 140421022110232 |
6 | 5051405541101 |
7 | 544425421534 |
oct | 123361205135 |
9 | 31823012711 |
10 | 11203316317 |
11 | 4829a86406 |
12 | 2207b74791 |
13 | 10970a326b |
14 | 783cb731b |
15 | 4588511e7 |
hex | 29bc50a5d |
11203316317 has 2 divisors, whose sum is σ = 11203316318. Its totient is φ = 11203316316.
The previous prime is 11203316291. The next prime is 11203316417. The reversal of 11203316317 is 71361330211.
11203316317 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., 10229501881 + 973814436 = 101141^2 + 31206^2 .
It is a cyclic number.
It is not a de Polignac number, because 11203316317 - 215 = 11203283549 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11203316017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5601658158 + 5601658159.
It is an arithmetic number, because the mean of its divisors is an integer number (5601658159).
Almost surely, 211203316317 is an apocalyptic number.
It is an amenable number.
11203316317 is a deficient number, since it is larger than the sum of its proper divisors (1).
11203316317 is an equidigital number, since it uses as much as digits as its factorization.
11203316317 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2268, while the sum is 28.
Adding to 11203316317 its reverse (71361330211), we get a palindrome (82564646528).
The spelling of 11203316317 in words is "eleven billion, two hundred three million, three hundred sixteen thousand, three hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •