Properties of the Number -36300

Thirty-Six Thousand Three Hundred

Basics

Value: -36301 → -36300 → -36299

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 2 ² × 3 × 5 ² × 11 ²

Divisors: 1, 2, 3, 4, 5, 6, 10, 11, 12, 15

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1000110111001100

Octal: -106714

Duodecimal: -19010

Hexadecimal: -8dcc

Square: 1317690000

Square Root: 190.5255888325765

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 integer partitions of n such that every pair of distinct parts has a different quotient. A325853

Numbers that have exactly three exponents in their prime factorization that are equal to 2. A386798

T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with every 2X2 subblock having equal diagonal elements or equal antidiagonal elements. A203378

Areas A of the triangles such that A, the sides and the three altitudes are integers. A210643

Triangle T(n,m,p,q) = (p^n-k*q^k + p^k*q^n-k)*(StirlingS2(n, k) + StirlingS2(n, n-k)) with p=2 and q=3, read by rows. A154916

a(n) is the number of subsets of {1..n} that contain 3 even and 3 odd numbers. A331574

Number of nonequivalent (mod D₈) ways to place 3 points on an n X n point grid so that no point is equally distant from two other points on the same row or the same column. A296996

Number of nonempty subsets of {1,2,...,n} in which exactly 1/4 of the elements are <= n/2. A47163

Number of nonempty subsets of {1,2,...,n} in which exactly 3/4 of the elements are <= n/2. A47164

Triangle read by rows: T(n,k) is the number of skew Dyck paths of semilength n and having k LDU's (n >= 0; 0 <= k <= floor((n-1)/3) for n >= 1). A128735