Properties of the Number -28783

Twenty-Eight Thousand Seven Hundred Eighty-Three

Basics

Value: -28784 → -28783 → -28782

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 107 × 269

Divisors: 1, 107, 269, 28783

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -111000001101111

Octal: -70157

Duodecimal: -147A7

Hexadecimal: -706f

Square: 828461089

Square Root: 169.65553336098412

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

T(n,k)=number of distinct solutions to sum{i=1..k}(x(2i-1)*x(2i)) == 0 (mod n), with x() in 0..n-1. A180803

Irregular triangle T(n,m), numerators of coefficients in a power/Fourier series expansion of the plane pendulum's exact time dependence. A274130

T(n,k)=Number of (n+6)X(k+6) 0..1 matrices with each 7X7 subblock idempotent. A224588

a(n) = ∑_{k=0..floor(n/3)} binomial(2·n-k+1,n-3·k). A371773

Number of partitions of n such that (number parts having multiplicity 1) is not a part and (number of 1s) is a part. A241507

Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 23 ones. A31791

Number of distinct solutions of sum{i=1..5}(x(2i-1)*x(2i)) = 0 (mod n), with x() in 0..n-1. A180797

Number of (n+6)X10 0..1 matrices with each 7X7 subblock idempotent. A224584

Number of (n+6)X11 0..1 matrices with each 7X7 subblock idempotent. A224585

Brilliant numbers (A078972) whose digit reversal is the product of 2 palindromes greater than 1. A115681