Base | Representation |
---|---|
bin | 11001000010001010101000… |
… | …000011010100111001110111 |
3 | 112102211110101002002120102112 |
4 | 121002022220003110321313 |
5 | 103412334310321010012 |
6 | 1030055125153001235 |
7 | 32122314625110002 |
oct | 3102125003247167 |
9 | 472743332076375 |
10 | 110100011110007 |
11 | 32099174a74416 |
12 | 10422152b5321b |
13 | 49585041a0a69 |
14 | 1d28c24654539 |
15 | cade498e4122 |
hex | 6422a80d4e77 |
110100011110007 has 2 divisors, whose sum is σ = 110100011110008. Its totient is φ = 110100011110006.
The previous prime is 110100011109967. The next prime is 110100011110069. The reversal of 110100011110007 is 700011110001011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 110100011110007 - 230 = 110098937368183 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110100011109973 and 110100011110000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110100011113007) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55050005555003 + 55050005555004.
It is an arithmetic number, because the mean of its divisors is an integer number (55050005555004).
Almost surely, 2110100011110007 is an apocalyptic number.
110100011110007 is a deficient number, since it is larger than the sum of its proper divisors (1).
110100011110007 is an equidigital number, since it uses as much as digits as its factorization.
110100011110007 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7, while the sum is 14.
Adding to 110100011110007 its reverse (700011110001011), we get a palindrome (810111121111018).
The spelling of 110100011110007 in words is "one hundred ten trillion, one hundred billion, eleven million, one hundred ten thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •