Properties of the Number -13555

Thirteen Thousand Five Hundred Fifty-Five

Basics

Value: -13556 → -13555 → -13554

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 5 × 2711

Divisors: 1, 5, 2711, 13555

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -11010011110011

Octal: -32363

Duodecimal: -7A17

Hexadecimal: -34f3

Square: 183738025

Square Root: 116.42594212631478

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

G.f. satisfies A(x) = (1 + x) * (1 + x·A(x)⁵). A364338

T(n,k)=Number of (n+1)X(k+1) 0..7 arrays with the permanents of all 2X2 subblocks equal and nonzero. A204791

The number of n-almost primes less than or equal to eⁿ, starting with a(0)=1. A116432

Array read by antidiagonals: T(m,n) (m >= 1, n >= 1) = number of reduced connected row convex (RCRC) constraints between an m-element set and an n-element set. A372066

A Fielder sequence. A1642

Poincaré series [or Poincare series] (or Molien series) for a certain four-fold wreath product P₄. A91434

Number of partitions p of n such that the number of parts is a part and max(p) - min(p) is not a part. A241384

a(n+2) = F(n+1)*a(n+1) + F(n)*a(n) where F(n) = Fibonacci number (A000045), a(0) = a(1) = 1. A89126

a(n) = floor(M(g(n-1)+1, ..., g(n))), where M = harmonic mean and g(n) = n³ + n² + n + 1. A227015

a(n+1) = a(n) converted to base 9 from base 8 (written in base 10). A23391