Properties of the Number 38251

Thirty-Eight Thousand Two Hundred Fifty-One

Basics

Value: 38250 → 38251 → 38252

Parity: odd

Prime: No

Previous Prime: 38239

Next Prime: 38261

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 29 × 1319

Divisors: 1, 29, 1319, 38251

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1001010101101011

Octal: 112553

Duodecimal: 1A177

Hexadecimal: 956b

Square: 1463139001

Square Root: 195.57862868933302

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

Number triangle read by rows: T(n,k) = ∑_j=0..n-k C(n+j,j+k)*C(n-j,k). A117207

Number of n element 0..3 arrays with each element the minimum of 5 adjacent elements of a random 0..3 array of n+4 elements. A217951

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 926", based on the 5-celled von Neumann neighborhood. A273778

a(n) = ∑_k=0..n binomial(n, floor(k/2 - 1/2)) * binomial(n, ceiling(k/2 - 1/2)). A378069

Number of nXnXn 0..6 triangular arrays with each element·equal to the number its neighbors equal to 1,4,0,1,1,0,0 for x=0,1,2,3,4,5,6. A197869

T(n,k) = number of n-element 0..3 arrays with each element the minimum of k adjacent elements of a random 0..3 array of n+k-1 elements. A217954

Triangle whose (i,j)-th entry is binomial(i,j)*5^i-j*9^j. A38251