Properties of the Number 36776

Thirty-Six Thousand Seven Hundred Seventy-Six

Basics

Value: 36775 → 36776 → 36777

Parity: even

Prime: No

Previous Prime: 36767

Next Prime: 36779

Digit Sum: 29

Digital Root: 2

Palindrome: No

Factorization: 2 ³ × 4597

Divisors: 1, 2, 4, 8, 4597, 9194, 18388, 36776

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000111110101000

Octal: 107650

Duodecimal: 19348

Hexadecimal: 8fa8

Square: 1352474176

Square Root: 191.7706964058899

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

Tetranacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3) + a(n-4), with initial conditions a(0..3) = (0, 0, 1, 0). A1631

Numbers k such that sum of digits of k = sum of digits of anti-divisors of k. A213239

Number of palindromic binary strings of length n having no 4-runs of 1's. A382478

Number of length 3 0..n arrays with each partial sum starting from the beginning no more than two standard deviations from its mean. A244834

Modified quadranacci series. A274759

Number of nX3 0..1 arrays with every element unequal to 0, 1, 2 or 6 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero. A318338

a(n) is the number of labeled rooted trees on a set of size n where each node has at most 4 neighbors that are further away from the root than the node itself. A36776

Number of (n+1)X(1+1) 0..3 arrays with the sum of each 2X2 subblock two median terms lexicographically nondecreasing columnwise and nonincreasing rowwise. A235749

G.f. A(x) satisfies x + x² = A(A(x)) - A(A(A(x)))². A384831