Base | Representation |
---|---|
bin | 110011110010000011… |
… | …0100010010110011101 |
3 | 101122000210111020111012 |
4 | 1213210012202112131 |
5 | 3310214440214323 |
6 | 123030213305005 |
7 | 11014444523156 |
oct | 1474406422635 |
9 | 348023436435 |
10 | 111201101213 |
11 | 43184139244 |
12 | 19675035165 |
13 | a6422b8697 |
14 | 554c91c92d |
15 | 2d5c79e678 |
hex | 19e41a259d |
111201101213 has 2 divisors, whose sum is σ = 111201101214. Its totient is φ = 111201101212.
The previous prime is 111201101161. The next prime is 111201101227. The reversal of 111201101213 is 312101102111.
It is an a-pointer prime, because the next prime (111201101227) can be obtained adding 111201101213 to its sum of digits (14).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 110524997209 + 676104004 = 332453^2 + 26002^2 .
It is a cyclic number.
It is not a de Polignac number, because 111201101213 - 214 = 111201084829 is a prime.
It is a super-3 number, since 3×1112011012133 (a number of 34 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111201101413) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55600550606 + 55600550607.
It is an arithmetic number, because the mean of its divisors is an integer number (55600550607).
Almost surely, 2111201101213 is an apocalyptic number.
It is an amenable number.
111201101213 is a deficient number, since it is larger than the sum of its proper divisors (1).
111201101213 is an equidigital number, since it uses as much as digits as its factorization.
111201101213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 111201101213 its reverse (312101102111), we get a palindrome (423302203324).
The spelling of 111201101213 in words is "one hundred eleven billion, two hundred one million, one hundred one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.446 sec. • engine limits •