As someone else said, you're right depending on how you define "analog quantum computing" because it's a bit of an overloaded term.
Quantum annealers work by slowly changing a Hamiltonian that corresponds to the problem you wish to solve, and the ground state that's measured at the end of the process corresponds to solution. There are people who debate whether annealers are QCs, because the annealing process takes much longer than the coherence time of the qubits used, so they don't fully utilize the "quantum-ness" in terms of superposition and entanglement. Also, annealers are only useful for solving a few classes of problems.
Gate-based quantum computers can implement any classical computing process and can utilize superposition and entanglement to solve some problems substantially faster than is possible classically. Since they utilize these quantum resources and are more general machines which can solve more classes of problems, quantum computing is more powerful than quantum annealing.
However, this kind of quantum computing can be digital or analog. Most of the well-known algorithms (Shor's, Grover's, etc) are designed for digital quantum computing, where we mostly think about the qubits as superpositions of $|0\rangle$ and $|1\rangle$. However, there is also ongoing research and some early demonstrations of analog quantum computing where the total output state after some evolution corresponds to some wavefunction in a different system of interest. This is often called quantum simulation, and is a promising technique for quantum chemistry and understanding how electrons are distributed in different molecules. Both of these modes are powerful, but are designed different applications.