Properties of the Number 39187

Thirty-Nine Thousand One Hundred Eighty-Seven

Basics

Value: 39186 → 39187 → 39188

Parity: odd

Prime: No

Previous Prime: 39181

Next Prime: 39191

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 149 × 263

Divisors: 1, 149, 263, 39187

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1001100100010011

Octal: 114423

Duodecimal: 1A817

Hexadecimal: 9913

Square: 1535620969

Square Root: 197.95706605221244

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

Integers k such that 10^k+49 is prime. A108054

T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with nondecreasing min(x(i,j),x(i,j-1)) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction. A250519

Number of partitions p of n such that floor(mean(p)) or ceiling(mean(p)) is a part. A241344

Number of subsets of [n] whose sum is a triangular number. A284250

a(n) = p(n)*p(n+1)*(p(n+1) - p(n)) - 1, where p(n) = prime(n). A383241

Number of (n+1)X(1+1) 0..3 arrays with nondecreasing min(x(i,j),x(i,j-1)) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction. A250512

Number of (n+1)X(4+1) 0..3 arrays with nondecreasing min(x(i,j),x(i,j-1)) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction. A250515

Number of Grassmannian permutations of size n that avoid a pattern, σ, where σ is a pattern of size 9 with exactly one descent. A362196

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, -1), (0, -1, 0), (1, -1, 0), (1, 1, 1)}. A149534

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, -1), (0, 0, -1), (1, 0, -1), (1, 1, 1)}. A149535