Base | Representation |
---|---|
bin | 1010001100000110110101… |
… | …1101010111000110010001 |
3 | 1110200000012002001200220112 |
4 | 2203001231131113012101 |
5 | 2432022432421340142 |
6 | 35454345503451105 |
7 | 2234253352214654 |
oct | 243015535270621 |
9 | 43600162050815 |
10 | 11203111121297 |
11 | 362a238188637 |
12 | 130b2a32b6a95 |
13 | 6335ab1632b4 |
14 | 2aa33a90789b |
15 | 146642d22382 |
hex | a306d757191 |
11203111121297 has 2 divisors, whose sum is σ = 11203111121298. Its totient is φ = 11203111121296.
The previous prime is 11203111121221. The next prime is 11203111121327. The reversal of 11203111121297 is 79212111130211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11187894418561 + 15216702736 = 3344831^2 + 123356^2 .
It is an emirp because it is prime and its reverse (79212111130211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11203111121297 - 224 = 11203094344081 is a prime.
It is a super-2 number, since 2×112031111212972 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11203111121597) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5601555560648 + 5601555560649.
It is an arithmetic number, because the mean of its divisors is an integer number (5601555560649).
Almost surely, 211203111121297 is an apocalyptic number.
It is an amenable number.
11203111121297 is a deficient number, since it is larger than the sum of its proper divisors (1).
11203111121297 is an equidigital number, since it uses as much as digits as its factorization.
11203111121297 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1512, while the sum is 32.
The spelling of 11203111121297 in words is "eleven trillion, two hundred three billion, one hundred eleven million, one hundred twenty-one thousand, two hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •