Properties of the Number -32114

Thirty-Two Thousand One Hundred Fourteen

Basics

Value: -32115 → -32114 → -32113

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 2 × 16057

Divisors: 1, 2, 16057, 32114

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -111110101110010

Octal: -76562

Duodecimal: -16702

Hexadecimal: -7d72

Square: 1031308996

Square Root: 179.20379460268134

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 n X k 0,1 arrays indicating 2 X 2 subblocks of some larger (n+1) X (k+1) binary array having determinant equal to one. A227751

G.f.: ∑_n>=0 xⁿ * (1 + xⁿ)ⁿ / (1 - xⁿ⁺¹)ⁿ⁺¹. A325046

G.f.: A(x) = (1+x) + x·A₂(x)²; A₂(x) = (1+x)² + x·A₃(x)²; ...; A_n(x) = (1+x)ⁿ + x·A_n+1(x)² for n>=1 with A(x) = A₁(x). A138295

Number of arrangements of 3 nonzero numbers x(i) in -n..n with the sum of div(x(i),x(i+1)), where div(a,b)=a/b produces the integer quotient implying a nonnegative remainder, equal to zero. A190072

Number of n X 3 0,1 arrays indicating 2 X 2 subblocks of some larger (n+1) X 4 binary array having determinant equal to one. A227748

a(n) = ∑_{-n<i<n, -n<j<n, gcd{i,j}=3} (n-|i|)*(n-|j|)/4. A331775

Numbers k such that A007923(k) is prime. A75766