Base | Representation |
---|---|
bin | 1001000101010101010… |
… | …11001101111001111101 |
3 | 1002211120212021122211202 |
4 | 10202222223031321331 |
5 | 20103140340214211 |
6 | 355213253425245 |
7 | 31356104405612 |
oct | 4425253157175 |
9 | 1084525248752 |
10 | 312101101181 |
11 | 1103a7a31771 |
12 | 505a203b225 |
13 | 2357ac011cc |
14 | 1116a35a509 |
15 | 81b9c5053b |
hex | 48aaacde7d |
312101101181 has 2 divisors, whose sum is σ = 312101101182. Its totient is φ = 312101101180.
The previous prime is 312101101141. The next prime is 312101101183. The reversal of 312101101181 is 181101101213.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 224999384281 + 87101716900 = 474341^2 + 295130^2 .
It is a cyclic number.
It is not a de Polignac number, because 312101101181 - 226 = 312033992317 is a prime.
It is a super-2 number, since 2×3121011011812 (a number of 24 digits) contains 22 as substring.
Together with 312101101183, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (312101101183) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 156050550590 + 156050550591.
It is an arithmetic number, because the mean of its divisors is an integer number (156050550591).
Almost surely, 2312101101181 is an apocalyptic number.
It is an amenable number.
312101101181 is a deficient number, since it is larger than the sum of its proper divisors (1).
312101101181 is an equidigital number, since it uses as much as digits as its factorization.
312101101181 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 20.
Adding to 312101101181 its reverse (181101101213), we get a palindrome (493202202394).
The spelling of 312101101181 in words is "three hundred twelve billion, one hundred one million, one hundred one thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •