Properties of the Number -36317

Thirty-Six Thousand Three Hundred Seventeen

Basics

Value: -36318 → -36317 → -36316

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 23 × 1579

Divisors: 1, 23, 1579, 36317

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1000110111011101

Octal: -106735

Duodecimal: -19025

Hexadecimal: -8ddd

Square: 1318924489

Square Root: 190.5701970403557

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 connected relations. A2502

Number of 2-colored connected labeled graphs with n vertices of the first color and n vertices of the second color. A5333

Array read by antidiagonals: T(m,n) = number of m X n binary matrices with all 1's connected and no zero rows or columns. A262307

Triangle read by rows: T(n,k) = number of specially labeled bicolored connected graphs with k points in one color class and n-k points in the other class . "Special" means there are separate labels 1,2, ...,k and 1,2, ...,n-k for the two color classes (n >= 1, k = floor((n+1)/2), ..., n). A123260

Number of horizontally convex n-ominoes in which the top row has exactly 1 square. A49219

Leading diagonal of A123260. A123281

T(n,k)=Number of nXk 0..4 arrays of sums of 2X2 subblocks of some (n+1)X(k+1) binary array. A226658

Triangle read by rows: T(n, m) for 0 <= m <= n is the number of bipartite connected labeled graphs with parts of size n and m. A227322