Properties of the Number -3930

Nine Hundred Thirty

Basics

Value: -3931 → -3930 → -3929

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 × 3 × 5 × 131

Divisors: 1, 2, 3, 5, 6, 10, 15, 30, 131, 262

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -111101011010

Octal: -7532

Duodecimal: -2336

Hexadecimal: -f5a

Square: 15444900

Square Root: 62.68971207462992

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 f(-q)¹⁰ / f(-q⁵)² in power of q where f() is a Ramanujan θ function. A243939

Total number of parts in all partitions of n plus the sum of largest parts of all partitions of n. A211978

Number of increasing arithmetic progressions in {1,2,3,...,n}, including trivial arithmetic progressions of lengths 1 and 2. A51336

Sum of quadratic residues of (n-th prime == 3 mod 4). A282035

Sum of the quadratic residues of prime(n). A76409

Triangle read by rows: T(n,k) = number of reversible string structures of length n using exactly k different symbols. A284949

Numbers divisible by prime(d) for each digit d in their base-4 representation, none of which may be zero. A256874

Generalized Mancala solitaire (A002491); to get n-th term, start with n and successively round up to next 7 multiples of n-1, n-2, ..., 1, for n>=1. A113744

a(n) = Frobenius number for 3 successive primes = F[p(n), p(n+1), p(n+2)]. A138989

a(1)=0; thereafter, a(n) is the smallest number such that the addition table for (a(1),...,a(n)) contains n*(n+1)/2 different entries, and the multiplication table for (a(2),...,a(n)) contains n*(n-1)/2 different nonzero entries (the maximum possible in both cases). A337656