Properties of the Number 36736

Thirty-Six Thousand Seven Hundred Thirty-Six

Basics

Value: 36735 → 36736 → 36737

Parity: even

Prime: No

Previous Prime: 36721

Next Prime: 36739

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 ⁷ × 7 × 41

Divisors: 1, 2, 4, 7, 8, 14, 16, 28, 32, 41

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000111110000000

Octal: 107600

Duodecimal: 19314

Hexadecimal: 8f80

Square: 1349533696

Square Root: 191.66637681137502

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 of returns to the x-axis in all hill-free Dyck paths of semilength n (a Dyck path is said to be hill-free if it has no peaks at level 1). A114495

T(n,k)=Number of length n+3 0..k arrays with no four elements in a row with pattern aabb (possibly a=b) and new values 0..k introduced in 0..k order. A242549

a(n) = 2^n-4*n*(n+1)*(n²+5·n-2). A58649

a(n) = (n⁴ + 2·n³ - n²)/2. A255499

p-INVERT of (1,0,1,0,0,0,0,...), where p(S) = (1 - 2 S)². A291732

a(n) = 36·n² - 4·n (n>=1). A304380

Product of all distinct nonzero numbers that can be formed from the digits of n. A61497

Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having k DUDU's starting at level 1. A135333

a(n) = q²*(q²+2·q-1)/2, where q = n-th prime power A000961(n). A229739

Triangle read by rows: Catalan triangle of the k-Fibonacci sequence. A236918