Properties of the Number 41345

Forty-One Thousand Three Hundred Forty-Five

Basics

Value: 41344 → 41345 → 41346

Parity: odd

Prime: No

Previous Prime: 41341

Next Prime: 41351

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 5 × 8269

Divisors: 1, 5, 8269, 41345

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1010000110000001

Octal: 120601

Duodecimal: 1BB15

Hexadecimal: a181

Square: 1709409025

Square Root: 203.3346994489627

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

Triangle, read by rows, defined by T(n,k) = T(n-1,k) + T(n,k-1) for nk>0, where T(n,0) = T(n-1,0) + T(n-1,n-1) and T(n,n) = T(n,n-1) for n>0 with T(0,0)=1. A129577

Column 0 of triangle A129577. A129578

Number of weighted lattice paths in L_n having no (1,0)-steps of weight 2 at level 0. A182892

Number of ordered triples (w,x,y) with all terms in {1,...,n} and w⁴<x⁴+y⁴. A211652

Triangle read by rows: T(n,k) is the number of weighted lattice paths in L_n having k (1,0)-steps of weight 2 at level 0. The members of L_n are paths of weight n that start at (0,0) , end on the horizontal axis and whose steps are of the following four kinds: an (1,0)-step with weight 1, an (1,0)-step with weight 2, a (1,1)-step with weight 2, and a (1,-1)-step with weight 1. The weight of a path is the sum of the weights of its steps. A182891

Denominators of continued fraction convergents to sqrt(186). A41345

Number of tilings of a 4 X n rectangle using dominoes and trominoes (of any shape). A364155

Number of base 25 circular n-digit numbers with adjacent digits differing by 2 or less. A124953

Number of 5 X n 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 2 neighboring 1s. A297435