Properties of the Number -28684

Twenty-Eight Thousand Six Hundred Eighty-Four

Basics

Value: -28685 → -28684 → -28683

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 2 ² × 71 × 101

Divisors: 1, 2, 4, 71, 101, 142, 202, 284, 404, 7171

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -111000000001100

Octal: -70014

Duodecimal: -14724

Hexadecimal: -700c

Square: 822771856

Square Root: 169.3635143707168

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 integer partitions of n whose median part is the smallest. A361860

a(n) = F(n+2) + c(n) where F(k) is k-th Fibonacci number and c(n) is n-th number that is 1 or is a non-Fibonacci number. A22800

a(n) = b(n) + d(n), where b(n) = (n-th Fibonacci number > 1) and d(n) = (n-th non-Lucas number). A23491

Number of (n+2) X 7 0..1 arrays with every 3 X 3 subblock having three equal elements in a row horizontally, vertically, diagonally or antidiagonally exactly three ways, and new values 0..1 introduced in row major order. A204751

Number of 5Xn 0..1 arrays with every element equal to 0 or 1 horizontally or antidiagonally adjacent elements, with upper left element zero. A301794

Number of n-digit left- or right-truncatable primes with no consecutive zero digits. A346662

a(n) = b(n) + d(n), where b(n) = (n-th Fibonacci number > 2) and d(n) = (n-th non-Fibonacci number). A23486