Properties of the Number -13155

Thirteen Thousand One Hundred Fifty-Five

Basics

Value: -13156 → -13155 → -13154

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 5 × 877

Divisors: 1, 3, 5, 15, 877, 2631, 4385, 13155

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -11001101100011

Octal: -31543

Duodecimal: -7743

Hexadecimal: -3363

Square: 173054025

Square Root: 114.69524837585905

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

Consider the triangle in which the n-th row starts with n, contains n terms and the difference of successive terms is 1,2,3,... up to n-1. Sequence gives row sums. A81498

Number of partitions of n in which the sequence of frequencies of the summands is nondecreasing. A100883

Triangle read by rows: T(n,k) is the number of partially labeled trees with n nodes, k of which are labeled, 0 <= k <= n. A34799

Number of strict compositions of n with no three consecutive parts in arithmetic progression. A325849

a(n) is the number of distinct solution sets to the quadratic equations u·x² + v·x + w = 0 with integer coefficients u, v, w, abs(u) + abs(v) + abs(w) <= n having a negative discriminant. A381710

Irregular triangle read by rows: T(n,k) is the number of non-isomorphic directed graphs reachable in k >= 0 steps (and no fewer) by n >= 1 agents using the ANY protocol (see A318154). A383386

Schoenheim bound L₁(n,n-5,n-6). A36837

Odd winning positions in Fibonacci nim. A120904

Fixed points of A075075. A185635

a(n) = (binomial(n,5) - floor(n/5)) / 5. A215052