ℕ atory
Play Now

Properties of the Number -8855

Eight Hundred Fifty-Five

Basics

Value: -8856 → -8855 → -8854

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 5 × 7 × 11 × 23

Divisors: 1, 5, 7, 11, 23, 35, 55, 77, 115, 161

Polygonal

Triangular: No

Square: No

Pentagonal: Yes

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -10001010010111

Octal: -21227

Duodecimal: -515B

Hexadecimal: -2297

Square: 78411025

Square Root: 94.10100955887773

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

Expansion of ∑k>0 x4·k/(1+xk)5. A363618
Binomial coefficient binomial(n,4) = n*(n-1)*(n-2)*(n-3)/24. A332
Lucas-Carmichael numbers: squarefree composite numbers k such that p | k => p+1 | k+1. A6972
Number of intersections of diagonals in the interior of a regular n-gon. A6561
Ruth-Aaron numbers (1): sum of prime divisors of n = sum of prime divisors of n+1. A6145
Numbers m such that there are precisely 3 groups of order m. A55561
a(n) = floor(Fibonacci(n)/2). A4695
a(n) = ∑k=0..floor(n/4) binomial(n-2k,2k). A5252
Pentagonal numbers with odd index: a(n) = (2·n+1)*(3·n+1). A33570
Triangular array T(n,k), read by rows: coefficients of strong divisibility sequence of polynomials p(1,x) = 1, p(2,x) = 1 + 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 - x - x2. A367208