Properties of the Number 37906

Thirty-Seven Thousand Nine Hundred Six

Basics

Value: 37905 → 37906 → 37907

Parity: even

Prime: No

Previous Prime: 37897

Next Prime: 37907

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 × 11 × 1723

Divisors: 1, 2, 11, 22, 1723, 3446, 18953, 37906

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1001010000010010

Octal: 112022

Duodecimal: 19B2A

Hexadecimal: 9412

Square: 1436864836

Square Root: 194.69463269438117

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

Expansion of g.f.: 1/((1 - x - x² + x⁴ - x⁶)*(1 - x² + x⁴ + x⁵ - x⁶)). A147606

Number of ways to partition digits 0-9 into signed terms in decreasing absolute value order with sum n. A389952

Triangle read by rows: T(n,k) is the number of weighted lattice paths in B(n) having k ascents. The members of B(n) are paths of weight n that start at (0,0), end on but never go below 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. An ascent is a maximal sequence of consecutive (1,1)-steps. A246186

Number of i such that |d(i) - d(i-1)| = 1, where ∑_i=0..m d(i)*3ⁱ is the base-3 representation of n. A37906