Properties of the Number 36627

Thirty-Six Thousand Six Hundred Twenty-Seven

Basics

Value: 36626 → 36627 → 36628

Parity: odd

Prime: No

Previous Prime: 36607

Next Prime: 36629

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 29 × 421

Divisors: 1, 3, 29, 87, 421, 1263, 12209, 36627

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000111100010011

Octal: 107423

Duodecimal: 19243

Hexadecimal: 8f13

Square: 1341537129

Square Root: 191.3818173181559

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

Triangle read by rows: number of set partitions of n elements with k connectors, 0<=k<n. A185982

Number of ways to fold a strip of n blank stamps. A1011

Second differences of A000219. A191660

Denominators of continued fraction convergents to sqrt(884). A42709

Number of set partitions of [n] having exactly three pairs (m,m+1) such that m is in some block b and m+1 is in block b+1. A271790

Row 5 of array in A320500. A320484

Erroneous version of A001011 ("folding a strip of stamps"). A3054

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, 1), (1, 0, -1), (1, 1, 0)}. A148714

Symmetric array read by antidiagonals: T(m,n) = number of "minimal connected vertex covers" of an m X n grid, for m>=1, n>=1. A320500

Number of 4-ary rooted trees with n nodes and height exactly 3. A36627