Properties of the Number 37910

Thirty-Seven Thousand Nine Hundred Ten

Basics

Value: 37909 → 37910 → 37911

Parity: even

Prime: No

Previous Prime: 37907

Next Prime: 37951

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 × 5 × 17 × 223

Divisors: 1, 2, 5, 10, 17, 34, 85, 170, 223, 446

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1001010000010110

Octal: 112026

Duodecimal: 19B32

Hexadecimal: 9416

Square: 1437168100

Square Root: 194.70490492024078

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..1 arrays with every element equal to 0, 2, 3, 4, 5 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. A303624

Smallest even k such that lpf(k-1) = prime(n), while lpf(k-3) > prime(n), where lpf=least prime factor (A020639). A242489

Engel expansion of ζ(3) = 1.20206... . A53980

Coefficient of·in the reduction by x²->x+1 of the polynomial p(n,x) defined below in Comments. A192755

Sequence lists numbers k > 1 such that k⁴ == d(k) (mod σ(k)), where d = A000005 and σ = A000203. A323251

Number of binary strings u of any length with property that length(u) + number of 0's in u <= n (only one of a string and its reversal are counted). A66067

Number of nX5 0..1 arrays with every element equal to 0, 2, 3, 4, 5 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. A303621

Number of 5Xn 0..1 arrays with every element equal to 0, 2, 3, 4, 5 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. A303627

a(n) = S(n) + c(n) where S(n) = [ (3/2)ⁿ ] and c is the complement of S. A22808

Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1),U=(1,2), or d=(1,-1) and having height of last peak equal to k. A109158