Base | Representation |
---|---|
bin | 1001000011101010000… |
… | …10000010000000110001 |
3 | 1002202021010210110221022 |
4 | 10201311002002000301 |
5 | 20044314441041423 |
6 | 354544103505225 |
7 | 31324565544023 |
oct | 4416502020061 |
9 | 1082233713838 |
10 | 311201112113 |
11 | 10aa85a07651 |
12 | 50390758215 |
13 | 2346660c7b8 |
14 | 110c2a04013 |
15 | 8165c26dc8 |
hex | 4875082031 |
311201112113 has 2 divisors, whose sum is σ = 311201112114. Its totient is φ = 311201112112.
The previous prime is 311201112023. The next prime is 311201112127. The reversal of 311201112113 is 311211102113.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 294537400369 + 16663711744 = 542713^2 + 129088^2 .
It is a cyclic number.
It is not a de Polignac number, because 311201112113 - 216 = 311201046577 is a prime.
It is a super-2 number, since 2×3112011121132 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 311201112091 and 311201112100.
It is not a weakly prime, because it can be changed into another prime (311201118113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 155600556056 + 155600556057.
It is an arithmetic number, because the mean of its divisors is an integer number (155600556057).
Almost surely, 2311201112113 is an apocalyptic number.
It is an amenable number.
311201112113 is a deficient number, since it is larger than the sum of its proper divisors (1).
311201112113 is an equidigital number, since it uses as much as digits as its factorization.
311201112113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 311201112113 its reverse (311211102113), we get a palindrome (622412214226).
The spelling of 311201112113 in words is "three hundred eleven billion, two hundred one million, one hundred twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •