Base | Representation |
---|---|
bin | 10100111000100101… |
… | …10001101010101001 |
3 | 1001221101112210220122 |
4 | 22130102301222221 |
5 | 140430244233223 |
6 | 5052322133025 |
7 | 544563203636 |
oct | 123422615251 |
9 | 31841483818 |
10 | 11212102313 |
11 | 4833a37465 |
12 | 220aab1175 |
13 | 1098b5b389 |
14 | 78512318d |
15 | 4594d95c8 |
hex | 29c4b1aa9 |
11212102313 has 2 divisors, whose sum is σ = 11212102314. Its totient is φ = 11212102312.
The previous prime is 11212102309. The next prime is 11212102333. The reversal of 11212102313 is 31320121211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9253862809 + 1958239504 = 96197^2 + 44252^2 .
It is an emirp because it is prime and its reverse (31320121211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11212102313 - 22 = 11212102309 is a prime.
It is a super-2 number, since 2×112121023132 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11212102291 and 11212102300.
It is not a weakly prime, because it can be changed into another prime (11212102303) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5606051156 + 5606051157.
It is an arithmetic number, because the mean of its divisors is an integer number (5606051157).
Almost surely, 211212102313 is an apocalyptic number.
It is an amenable number.
11212102313 is a deficient number, since it is larger than the sum of its proper divisors (1).
11212102313 is an equidigital number, since it uses as much as digits as its factorization.
11212102313 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 11212102313 its reverse (31320121211), we get a palindrome (42532223524).
The spelling of 11212102313 in words is "eleven billion, two hundred twelve million, one hundred two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •