Base | Representation |
---|---|
bin | 11001000000110111110100… |
… | …100010101111010110110001 |
3 | 112102111221212201100021202112 |
4 | 121000313310202233112301 |
5 | 103404410213111200032 |
6 | 1025550222433255105 |
7 | 32113016421022304 |
oct | 3100676442572661 |
9 | 472457781307675 |
10 | 110011100100017 |
11 | 3206449a028676 |
12 | 10408a7aa04495 |
13 | 4950004b75c8c |
14 | 1d247cc22ab3b |
15 | cab993e761b2 |
hex | 640df48af5b1 |
110011100100017 has 2 divisors, whose sum is σ = 110011100100018. Its totient is φ = 110011100100016.
The previous prime is 110011100099987. The next prime is 110011100100061. The reversal of 110011100100017 is 710001001110011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 56899202440336 + 53111897659681 = 7543156^2 + 7287791^2 .
It is a cyclic number.
It is not a de Polignac number, because 110011100100017 - 240 = 108911588472241 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110011100099974 and 110011100100010.
It is not a weakly prime, because it can be changed into another prime (110011100100617) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55005550050008 + 55005550050009.
It is an arithmetic number, because the mean of its divisors is an integer number (55005550050009).
Almost surely, 2110011100100017 is an apocalyptic number.
It is an amenable number.
110011100100017 is a deficient number, since it is larger than the sum of its proper divisors (1).
110011100100017 is an equidigital number, since it uses as much as digits as its factorization.
110011100100017 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 7, while the sum is 14.
Adding to 110011100100017 its reverse (710001001110011), we get a palindrome (820012101210028).
The spelling of 110011100100017 in words is "one hundred ten trillion, eleven billion, one hundred million, one hundred thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •