Properties of the Number 34195

Thirty-Four Thousand One Hundred Ninety-Five

Basics

Value: 34194 → 34195 → 34196

Parity: odd

Prime: No

Previous Prime: 34183

Next Prime: 34211

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 5 × 7 × 977

Divisors: 1, 5, 7, 35, 977, 4885, 6839, 34195

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000010110010011

Octal: 102623

Duodecimal: 17957

Hexadecimal: 8593

Square: 1169298025

Square Root: 184.9189011431768

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 nXk 0..3 arrays with every repeated value in every row unequal to the previous repeated value, and in every column equal to the previous repeated value, and new values introduced in row-major sequential order. A268423

Numerators of continued fraction convergents to sqrt(305). A41574

Expansion of (5-9·x)/(1-6·x+7·x²). A164037

Numerators of e.g.f.: tan(arccosh(x)) = cot(arcsinh(x)). A102061

Number of nX2 0..3 arrays with every repeated value in every row unequal to the previous repeated value, and in every column equal to the previous repeated value, and new values introduced in row-major sequential order. A268420

Number of 5Xn 0..3 arrays with every repeated value in every row unequal to the previous repeated value, and in every column equal to the previous repeated value, and new values introduced in row-major sequential order. A268425

Triangle T(n,k), n>=1, 0<=k<=n², read by rows: row n gives the coefficients of the chromatic polynomial of the square grid graph G_n,n, highest powers first. A182368

Number of binary codes of length 10 with n words. A34195

4-loop graph coloring a rectangular array: number of nX5 0..8 arrays where 0..8 label nodes of a graph with edges 0,1 1,2 2,0 0,3 3,4 4,0 0,5 5,6 6,0 0,7 7,8 8,0 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph. A223294