Properties of the Number 97565

Ninety-Seven Thousand Five Hundred Sixty-Five

Basics

Value: 97564 → 97565 → 97566

Parity: odd

Prime: No

Previous Prime: 97561

Next Prime: 97571

Digit Sum: 32

Digital Root: 5

Palindrome: No

Factorization: 5 × 13 × 19 × 79

Divisors: 1, 5, 13, 19, 65, 79, 95, 247, 395, 1027

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 10111110100011101

Octal: 276435

Duodecimal: 48565

Hexadecimal: 17d1d

Square: 9518929225

Square Root: 312.35396587845656

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

T(n,k) = number of defective 4-colorings of an n X k 0..3 array connected horizontally, vertically, diagonally and antidiagonally with exactly two mistakes, and colors introduced in row-major 0..3 order. A229755

Numbers k such that k and k+1 have at least 4 but not both exactly 4 distinct prime factors. A321494

Triangle, read by rows, where row n forms a polynomial in y=2·k that generates diagonal n as k=0,1,2,... for n>=0; thus T(n,k) = ∑_j=0..n-k T(n-k,j)*(2·k)^j, with T(n,0)=T(n,n)=1. A113711

Column 2 of triangle A113711, in which row n forms a polynomial in y=2·k that generates diagonal n as k=0,1,2,... for n>=0. A113713

Number of length 6 walks on an n-dimensional hypercubic lattice starting and finishing at the origin and staying in the nonnegative part. A64046

Number of defective 4-colorings of an n X 3 0..3 array connected horizontally, vertically, diagonally and antidiagonally with exactly two mistakes, and colors introduced in row-major 0..3 order. A229750

Weight distribution of [80,40,16] binary extended quadratic-residue (or QR) code. A145659

a(0) = 0, a(1) = 1, a(n) = (a(n-1) mod F(n))*a(n-1) + a(n-2) for n > 2 where F(n) is the n-th Fibonacci number. A97565

Least k such that k + A005117(i) is squarefree with i prime factors, for 1 <= i <= n. A389393