Properties of the Number -6932

Nine Hundred Thirty-Two

Basics

Value: -6933 → -6932 → -6931

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 ² × 1733

Divisors: 1, 2, 4, 1733, 3466, 6932

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -1101100010100

Octal: -15424

Duodecimal: -4018

Hexadecimal: -1b14

Square: 48052624

Square Root: 83.2586331859946

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

a(n) = ∑_k=1..n (-1)^k*k³*floor(n/k). A366917

Number of integer partitions of n whose mean is not an integer. A349156

Number T(n,k) of set partitions of [n] such that k is the largest element of the last block; triangle T(n,k), n>=1, 1<=k<=n, read by rows. A271466

Number of partitions satisfying (cn(2,5) = cn(3,5) = 0). A36820

T(n,k)=Number of 0..k arrays of length n with each element differing from at least one neighbor by 1 or less, starting with 0. A221683

T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with every 2X2 and 3X3 subblock diagonal sum minus antidiagonal sum unequal to its neighbors horizontally and vertically. A253740

G.f. A(x) satisfies: A(x) = 1 + x + x² + x³ + x⁴ + x⁵*A(x)². A307972

a(0)=2, a(n) = n²+a(n-1). A153056

Number of partitions of n into parts having at most two prime-factors. A101049

a(n) = A056520(n)+1 for n>0, a(0)=1. A179904