Properties of the Number -83655

Eighty-Three Thousand Six Hundred Fifty-Five

Basics

Value: -83656 → -83655 → -83654

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 5 × 11 × 13 ²

Divisors: 1, 3, 5, 9, 11, 13, 15, 33, 39, 45

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -10100011011000111

Octal: -243307

Duodecimal: -404B3

Hexadecimal: -146c7

Square: 6998159025

Square Root: 289.2317409967309

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

Number of irreducible alternating Euler sums of depth 6 and weight 6+2n. A11796

a(n) = 13·a(n-1) - 65·a(n-2) + 156·a(n-3) - 182·a(n-4) + 91·a(n-5) - 13·a(n-6), with initial terms 6, 13, 39, 130, 455, 1638. A216508

a(n) = C(n+2, 2) + C(n+2, 3) + C(n+2, 4) + C(n+2, 5). A27660

Number of subsets of 6 integers between 1 and n such that their sum is 1 modulo n. A381290

Triangle read by rows: T(n, k) = binomial(3·n, k-1) + binomial(3·n, n-k). A156003

Abundant numbers whose aliquot sequence is abundant, deficient, abundant, ..., etc. A234969

Number of (n+2)X(6+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00010011. A260765

a(n) = H(n-1, n, n+1) where H(a, b, c) = (a + b + c)*(a + b - c)*(b + c - a)*(c + a - b) is Heron's polynomial. A339488