Properties of the Number -36075

Thirty-Six Thousand Seventy-Five

Basics

Value: -36076 → -36075 → -36074

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 5 ² × 13 × 37

Divisors: 1, 3, 5, 13, 15, 25, 37, 39, 65, 75

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1000110011101011

Octal: -106353

Duodecimal: -18A63

Hexadecimal: -8ceb

Square: 1301405625

Square Root: 189.93419913222579

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 ordered ways of writing n-th triangular number as a sum of n nonzero triangular numbers. A298858

T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with no row, column, diagonal or antidiagonal in any 3X3 subblock summing to 2 or 4. A251682

Number of ways to write n as an ordered sum of 9 nonzero triangular numbers. A340954

G.f. A(x) satisfies: A(x) = 1 + x·A(x)² / (A(x) - 2·x*A'(x)). A352236

Number of Dyck paths of semilength n with no UUDU's starting at level 0. A135336

From George Gilbert's marks problem: jumping 4 marks at a time (initial positions). A19595

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

Number of (n+2)X(2+2) 0..2 arrays with no row, column, diagonal or antidiagonal in any 3X3 subblock summing to 2 or 4. A251676

Number of (n+2)X(6+2) 0..2 arrays with no row, column, diagonal or antidiagonal in any 3X3 subblock summing to 2 or 4. A251680

Numbers k such that A060648(k) is divisible by k. A307227