Base | Representation |
---|---|
bin | 110011101110110110110… |
… | …1011100001100100011001 |
3 | 221011201011220001212102222 |
4 | 1213131231223201210121 |
5 | 1412442300304013423 |
6 | 23042143255033425 |
7 | 1332452462226656 |
oct | 147355553414431 |
9 | 27151156055388 |
10 | 7110011001113 |
11 | 22a137a941789 |
12 | 969b7436b875 |
13 | 3c76181a7967 |
14 | 1a81aaa80c2d |
15 | c4e3376b3c8 |
hex | 6776dae1919 |
7110011001113 has 2 divisors, whose sum is σ = 7110011001114. Its totient is φ = 7110011001112.
The previous prime is 7110011001101. The next prime is 7110011001133. The reversal of 7110011001113 is 3111001100117.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4511766824464 + 2598244176649 = 2124092^2 + 1611907^2 .
It is a cyclic number.
It is not a de Polignac number, because 7110011001113 - 210 = 7110011000089 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 7110011001091 and 7110011001100.
It is not a weakly prime, because it can be changed into another prime (7110011001133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3555005500556 + 3555005500557.
It is an arithmetic number, because the mean of its divisors is an integer number (3555005500557).
Almost surely, 27110011001113 is an apocalyptic number.
It is an amenable number.
7110011001113 is a deficient number, since it is larger than the sum of its proper divisors (1).
7110011001113 is an equidigital number, since it uses as much as digits as its factorization.
7110011001113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 21, while the sum is 17.
The spelling of 7110011001113 in words is "seven trillion, one hundred ten billion, eleven million, one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •