Base | Representation |
---|---|
bin | 1101001111110101… |
… | …01111100101001101 |
3 | 200100122210020121002 |
4 | 12213322233211031 |
5 | 104031203132423 |
6 | 3133422150045 |
7 | 341150243024 |
oct | 64772574515 |
9 | 20318706532 |
10 | 7112161613 |
11 | 301a6a2317 |
12 | 1465a22325 |
13 | 89461716b |
14 | 4b67d58bb |
15 | 2b95c2228 |
hex | 1a7eaf94d |
7112161613 has 2 divisors, whose sum is σ = 7112161614. Its totient is φ = 7112161612.
The previous prime is 7112161487. The next prime is 7112161631. The reversal of 7112161613 is 3161612117.
It is a happy number.
Together with next prime (7112161631) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7083410569 + 28751044 = 84163^2 + 5362^2 .
It is an emirp because it is prime and its reverse (3161612117) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 7112161613 - 216 = 7112096077 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (7112161673) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3556080806 + 3556080807.
It is an arithmetic number, because the mean of its divisors is an integer number (3556080807).
Almost surely, 27112161613 is an apocalyptic number.
It is an amenable number.
7112161613 is a deficient number, since it is larger than the sum of its proper divisors (1).
7112161613 is an equidigital number, since it uses as much as digits as its factorization.
7112161613 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1512, while the sum is 29.
The square root of 7112161613 is about 84333.6327511154. The cubic root of 7112161613 is about 1923.0941152827.
The spelling of 7112161613 in words is "seven billion, one hundred twelve million, one hundred sixty-one thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •