Base | Representation |
---|---|
bin | 110011100010001111… |
… | …1010000010101100001 |
3 | 101120122211110120200101 |
4 | 1213010133100111201 |
5 | 3303123200210423 |
6 | 122501425222401 |
7 | 10665344341345 |
oct | 1470437202541 |
9 | 346584416611 |
10 | 110670710113 |
11 | 42a31804597 |
12 | 19547491a01 |
13 | a5894525b2 |
14 | 54dc2d5625 |
15 | 2d2ae317ad |
hex | 19c47d0561 |
110670710113 has 2 divisors, whose sum is σ = 110670710114. Its totient is φ = 110670710112.
The previous prime is 110670710099. The next prime is 110670710131. The reversal of 110670710113 is 311017076011.
Together with next prime (110670710131) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 91208228049 + 19462482064 = 302007^2 + 139508^2 .
It is a cyclic number.
It is not a de Polignac number, because 110670710113 - 233 = 102080775521 is a prime.
It is not a weakly prime, because it can be changed into another prime (110670710173) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55335355056 + 55335355057.
It is an arithmetic number, because the mean of its divisors is an integer number (55335355057).
Almost surely, 2110670710113 is an apocalyptic number.
It is an amenable number.
110670710113 is a deficient number, since it is larger than the sum of its proper divisors (1).
110670710113 is an equidigital number, since it uses as much as digits as its factorization.
110670710113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 882, while the sum is 28.
Adding to 110670710113 its reverse (311017076011), we get a palindrome (421687786124).
The spelling of 110670710113 in words is "one hundred ten billion, six hundred seventy million, seven hundred ten thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •