Properties of the Number 66169

Sixty-Six Thousand One Hundred Sixty-Nine

Basics

Value: 66168 → 66169 → 66170

Parity: odd

Prime: Yes

Previous Prime: 66161

Next Prime: 66173

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 66169

Divisors: 1, 66169

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10000001001111001

Octal: 201171

Duodecimal: 32361

Hexadecimal: 10279

Square: 4378336561

Square Root: 257.2333570904054

Classification

Fibonacci: No

Bell Number: No

Factorial Number: No

Regular Number: No

Perfect Number: No

Special

Kaprekar Constant: No

Munchausen Constant: No

Armstrong Number: No

Kaprekar Number: No

Catalan Number: No

Vampire Number: No

Taxicab Number: No

Super Prime: No

Friedman Number: No

Fermat Number: No

Cullen Number: No

OEIS Sequences

Conjecturally, number of infinitely-recurring prime patterns on n consecutive integers. A23192

Let A = A025584. a(n) is the smallest A(m) such that the interval (A(m)*n, A(m+1)*n) contains no primes from A. A207820

a(n) = 2·a(n-1) - a(n-2) + a(n-4) for n>3, a(0)=2, a(1)=3, a(2)=5, a(3)=7, a sequence related to Lucas numbers. A291660

Number of (n+1) X (3+1) 0..1 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing x(i,j)-x(i-1,j) in the j direction. A250606

Prime numbers followed by two consecutive numbers which are products of four distinct primes (or tetraprimes). A362578

Least k such that φ(k) >= n. A66169

T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing x(i,j)-x(i-1,j) in the j direction. A250611