Properties of the Number -134596

One Hundred Thirty-Four Thousand Five Hundred Ninety-Six

Basics

Value: -134597 → -134596 → -134595

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 2 ² × 7 × 11 × 19 × 23

Divisors: 1, 2, 4, 7, 11, 14, 19, 22, 23, 28

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8109 Try Today's Challenge

Representations

Binary: -100000110111000100

Octal: -406704

Duodecimal: -65A84

Hexadecimal: -20dc4

Square: 18116083216

Square Root: 366.87327512371354

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

First term of n-th difference sequence of (round(k·sqrt(2))), k >= 0. A325840

Figurate numbers or binomial coefficients C(n,6). A579

a(n) = binomial(4n,n). A5810

Table by antidiagonals of number of ways of choosing k items from n·k. A60539

a(n) = (2ⁿ/n!) * ∏_k=0..n-1 (4·k + 3). A4982

a(n) = binomial(3n+6, n). A3408

Triangle, read by rows, where T(n,k) = binomial(n*(n-1)/2 - k*(k-1)/2 + n-k+3, n-k). A107873

Number of compositions of n into 7 ordered relatively prime parts. A23032

a(n) = binomial(n, floor(n/4)). A51036

Triangle T(n,k) = d(n-k,n), 0 <= k <= n, where d(l,m) = ∑_k=l..m 2^k * binomial(2·m-2·k, m-k) * binomial(m+k, m) * binomial(k, l). A67001