Strobogrammatic Numbers Strobogrammatic Numbers

Definition
A number which is rotationally symmetrical, i.e., it'll appear the same when rotated by 180 deg in the plane of your screen. The following figure illustrates it better,


(source: w3resource.com)
Task
Given a number as the input, determine if it's strobogrammatic or not.
Examples

Truthy

1
8
0
69
96
69169
1001
666999
888888
101010101


Falsey

2
3
4
5
7
666
969
1000
88881888
969696969

Rules

The number is guaranteed to be less than a billion.
We are considering 1 in it's roman numeral format for the sake of the challenge.
Input can be taken as number, or an array of chars, or as string.
Output would be a truthy/falsey value. However, you are allowed to flip the output values.
This is a code-golf, so fewest bytes will win!


Sandbox link
Node.js 11.6.0,  34  33 bytes
Expects an array of digits. Returns false for strobogrammatic, or true otherwise.

n=&gt;n.some(c=&gt;n.pop()-c**66%79%63)

Try it online!
How?
Taking the precision errors on large integers into account1, we look for a function:
$$f(x)=(x^p\bmod m_0)\bmod m_1$$
such that:
$$f(0)=0,\:f(1)=1,\:f(6)=9,\:f(8)=8,\:f(9)=6$$
and:
$$f(x)&gt;9\text{ for }x\in\{2,3,4,5,7\}$$
1: These errors actually depend on the JS engine. This is guaranteed to work with Node 11.6.0.

JavaScript (ES6), 38 bytes
Expects an array of digits. Returns false for strobogrammatic, or true otherwise.

n=&gt;n.some(c=&gt;n.pop()!=&quot;01----9-86&quot;[c])

Try it online!