Base | Representation |
---|---|
bin | 1010001100101000110100… |
… | …0111100001100001001001 |
3 | 1110200212201201222121211221 |
4 | 2203022031013201201021 |
5 | 2432200122420433223 |
6 | 35502454532122041 |
7 | 2235025365141622 |
oct | 243121507414111 |
9 | 43625651877757 |
10 | 11212232202313 |
11 | 363309885981a |
12 | 1311009a66321 |
13 | 634402a2855c |
14 | 2aa96403aa49 |
15 | 1469c8969b5d |
hex | a328d1e1849 |
11212232202313 has 2 divisors, whose sum is σ = 11212232202314. Its totient is φ = 11212232202312.
The previous prime is 11212232202307. The next prime is 11212232202317. The reversal of 11212232202313 is 31320223221211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10121738635024 + 1090493567289 = 3181468^2 + 1044267^2 .
It is an emirp because it is prime and its reverse (31320223221211) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11212232202313 is a prime.
It is not a weakly prime, because it can be changed into another prime (11212232202317) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5606116101156 + 5606116101157.
It is an arithmetic number, because the mean of its divisors is an integer number (5606116101157).
Almost surely, 211212232202313 is an apocalyptic number.
It is an amenable number.
11212232202313 is a deficient number, since it is larger than the sum of its proper divisors (1).
11212232202313 is an equidigital number, since it uses as much as digits as its factorization.
11212232202313 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 11212232202313 its reverse (31320223221211), we get a palindrome (42532455423524).
The spelling of 11212232202313 in words is "eleven trillion, two hundred twelve billion, two hundred thirty-two million, two hundred two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.165 sec. • engine limits •