Properties of the Number 37701

Thirty-Seven Thousand Seven Hundred One

Basics

Value: 37700 → 37701 → 37702

Parity: odd

Prime: No

Previous Prime: 37699

Next Prime: 37717

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 59 × 71

Divisors: 1, 3, 9, 59, 71, 177, 213, 531, 639, 4189

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1001001101000101

Octal: 111505

Duodecimal: 19999

Hexadecimal: 9345

Square: 1421365401

Square Root: 194.16745350341287

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

If F(n) is the n-th Fibonacci number, then a(2n) = (F(2n+1) + F(n+2))/2 and a(2n+1) = (F(2n+2) + F(n+1))/2. A1224

a(n) = (F(2·n-1) + F(n+1))/2 where F(n) is a Fibonacci number. A5207

T(n,k) = Number of (n+1) X (k+1) 0..2 arrays with the maximum plus the upper median plus the lower median of every 2 X 2 subblock equal. A236884

Number of incongruent ways to tile a 3 X 2n room with 1x2 Tatami mats. At most 3 Tatami mats may meet at a point. A68928

Number of distinct ways to tile a 2 X n rectangle with dominoes (solutions are identified if they are rotations or reflections of each other). A60312

Duplicate of A001224. A102526

The subsequence A253065(2ⁿ-1). A253067

a(n) = ( (9 + sqrt(6))ⁿ - (9 - sqrt(6))ⁿ )/(2·sqrt(6)). A154241

Number of (n+1)X(1+1) 0..2 arrays with the maximum plus the upper median plus the lower median of every 2X2 subblock equal. A236877

Number of (n+1)X(7+1) 0..2 arrays with the maximum plus the upper median plus the lower median of every 2X2 subblock equal. A236883