Properties of the Number -4536

Five Hundred Thirty-Six

Basics

Value: -4537 → -4536 → -4535

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 ³ × 3 ⁴ × 7

Divisors: 1, 2, 3, 4, 6, 7, 8, 9, 12, 14

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -1000110111000

Octal: -10670

Duodecimal: -2760

Hexadecimal: -11b8

Square: 20575296

Square Root: 67.34983296193094

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 of Stirling numbers of first kind, s(n,k), n >= 1, 1 <= k <= n. A8275

Triangle of Stirling numbers of first kind, s(n,k), n >= 0, 0 <= k <= n. A48994

Triangle of Stirling numbers of first kind, s(n, n-k+1), n >= 1, 1 <= k <= n. Also triangle T(n,k) giving coefficients in expansion of n!*binomial(x,n)/x in powers of x. A8276

Coefficient array for certain polynomials N(4; k,x) (rising powers in x). A62751

Expansion of (f(x³) / f(x))⁶ in powers of·where f() is a Ramanujan θ function. A264026

A triangular sequence of coefficients based on the expansion of a Morse potential type function: p(x,t) = exp(x·t)*(exp(-2·t) - 2·exp(-t)). A138106

Triangle, read by rows, where T(n,k) = A008275(k+1,n-k+1) are Stirling numbers of the first kind. A104416

Triangle read by rows, expansion of exp(x·z)*z*((exp(z) + 1)/((exp(z) + 2·exp(-z/2)*cos(z·sqrt(3)/2))/3) -1), for n >= 1 and 0 <= k <= n-1. A294034

Triangle of unsigned Stirling numbers of the first kind (see A048994), read by rows, T(n,k) for 0 <= k <= n. A132393

Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in increasing powers of x. T(n,k) is also the unsigned Stirling number |s(n+1, k+1)|, denoting the number of permutations on n+1 elements that contain exactly k+1 cycles. A130534