Base | Representation |
---|---|
bin | 1010001100000011100100… |
… | …0000011001011001011101 |
3 | 1110122220220202011122220002 |
4 | 2203000321000121121131 |
5 | 2432014132131111214 |
6 | 35454122310104045 |
7 | 2234222505243005 |
oct | 243007100313135 |
9 | 43586822148802 |
10 | 11202231113309 |
11 | 3629926470605 |
12 | 130b09864b025 |
13 | 63349aa49502 |
14 | 2aa295ab3005 |
15 | 1465e09441de |
hex | a303901965d |
11202231113309 has 2 divisors, whose sum is σ = 11202231113310. Its totient is φ = 11202231113308.
The previous prime is 11202231113279. The next prime is 11202231113317. The reversal of 11202231113309 is 90331113220211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9833806092100 + 1368425021209 = 3135890^2 + 1169797^2 .
It is an emirp because it is prime and its reverse (90331113220211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11202231113309 - 212 = 11202231109213 is a prime.
It is a super-3 number, since 3×112022311133093 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11202231143309) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5601115556654 + 5601115556655.
It is an arithmetic number, because the mean of its divisors is an integer number (5601115556655).
Almost surely, 211202231113309 is an apocalyptic number.
It is an amenable number.
11202231113309 is a deficient number, since it is larger than the sum of its proper divisors (1).
11202231113309 is an equidigital number, since it uses as much as digits as its factorization.
11202231113309 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1944, while the sum is 29.
The spelling of 11202231113309 in words is "eleven trillion, two hundred two billion, two hundred thirty-one million, one hundred thirteen thousand, three hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •