Properties of the Number 69198

Sixty-Nine Thousand One Hundred Ninety-Eight

Basics

Value: 69197 → 69198 → 69199

Parity: even

Prime: No

Previous Prime: 69197

Next Prime: 69203

Digit Sum: 33

Digital Root: 6

Palindrome: No

Factorization: 2 × 3 × 19 × 607

Divisors: 1, 2, 3, 6, 19, 38, 57, 114, 607, 1214

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10000111001001110

Octal: 207116

Duodecimal: 34066

Hexadecimal: 10e4e

Square: 4788363204

Square Root: 263.0551273022444

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

Row sums of triangle A054446 (partial row sums triangle of Fibonacci convolution triangle). A54447

Number of canonical 3-polytopes of size n. A319959

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

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

Number of walks within N² (the first quadrant of Z²) starting at (0,0), ending on the vertical axis and consisting of n steps taken from {(-1, -1), (-1, 0), (-1, 1), (0, -1), (1, 0)}. A151504

a(1)=1 a(2)=6 a(n+2)=(a(n+1)+a(n))/3 if (a(n+1)+a(n)==0 (mod 3)); a(n+2)=(a(n+1)+a(n))/2 if (a(n+1)+a(n)==0 (mod 2)); a(n+2)=a(n+1)+a(n) otherwise. A69198