Base | Representation |
---|---|
bin | 110011110101010110… |
… | …1111101101111011001 |
3 | 101122022112100120121222 |
4 | 1213222231331233121 |
5 | 3310431344202223 |
6 | 123045220341425 |
7 | 11020263145541 |
oct | 1475255755731 |
9 | 348275316558 |
10 | 111312100313 |
11 | 43230862537 |
12 | 196a6244875 |
13 | a65c2b071b |
14 | 555d574321 |
15 | 2d673c80c8 |
hex | 19eab7dbd9 |
111312100313 has 2 divisors, whose sum is σ = 111312100314. Its totient is φ = 111312100312.
The previous prime is 111312100219. The next prime is 111312100349. The reversal of 111312100313 is 313001213111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 111120222409 + 191877904 = 333347^2 + 13852^2 .
It is a cyclic number.
It is not a de Polignac number, because 111312100313 - 28 = 111312100057 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 111312100291 and 111312100300.
It is not a weakly prime, because it can be changed into another prime (111312100363) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55656050156 + 55656050157.
It is an arithmetic number, because the mean of its divisors is an integer number (55656050157).
Almost surely, 2111312100313 is an apocalyptic number.
It is an amenable number.
111312100313 is a deficient number, since it is larger than the sum of its proper divisors (1).
111312100313 is an equidigital number, since it uses as much as digits as its factorization.
111312100313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 111312100313 its reverse (313001213111), we get a palindrome (424313313424).
The spelling of 111312100313 in words is "one hundred eleven billion, three hundred twelve million, one hundred thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •