Properties of the Number -6255

Two Hundred Fifty-Five

Basics

Value: -6256 → -6255 → -6254

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 5 × 139

Divisors: 1, 3, 5, 9, 15, 45, 139, 417, 695, 1251

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -1100001101111

Octal: -14157

Duodecimal: -3753

Hexadecimal: -186f

Square: 39125025

Square Root: 79.0885579587844

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

Convolution of Fibonacci numbers and {F(2), F(3), F(4), ...}. A23610

a(n) = n*(3·n + 4). A140676

Triangular array T(n,k), read by rows: coefficients of strong divisibility sequence of polynomials p(1,x) = 1, p(2,x) = 3 + 3·x, p(n,x) = u·p(n-1,x) + v·p(n-2,x) for n >= 3, where u = p(2,x), v = 1 - 2·x - x². A367301

Integer part of square root of n⁵ = A000584(n). A155013

Number of n-regular, N₀-weighted pseudographs on 2 vertices with total edge weight 8, up to isomorphism. A358248

T(n,k)=Equals one maps: number of nXk binary arrays indicating the locations of corresponding elements equal to exactly one of their horizontal, vertical and antidiagonal neighbors in a random 0..1 nXk array. A220461

a(n) is the number of positive integers <= 10ⁿ that are divisible by no prime exceeding 3. A100752

Number of distinct values of ∑_i=0..n x(i)*binomial(n,i), where the x(i) have values in 0..2. A205537

a(n) is the number of partitions of n with Durfee square of size <= 2. A330640

a(n) = dot_product(1,2,...,n)*(3,4,...,n,1,2). A26037