Properties of the Number -38932

Thirty-Eight Thousand Nine Hundred Thirty-Two

Basics

Value: -38933 → -38932 → -38931

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 ² × 9733

Divisors: 1, 2, 4, 9733, 19466, 38932

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1001100000010100

Octal: -114024

Duodecimal: -1A644

Hexadecimal: -9814

Square: 1515700624

Square Root: 197.3119357768303

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

Triangle read by rows: T(n,k) = number of configurations of k nonattacking bishops on the black squares of an n X n chessboard (0 <= k <= n - [n>1]). A274105

Number of perfect-powers·in the range 2ⁿ < x < 2ⁿ⁺¹. A377467

Triangle read by rows: T(n,k) = number of configurations of k non-attacking bishops on the white squares of an n X n chessboard (for n even, 0 <= k < n). A88960

Triangle read by rows: T(n,k) = total number of configurations of k nonattacking bishops on the white squares of an n X n chessboard (0 <= k <= n-1+[n=0]). A274106

Triangular sequence defined by T(n, m) = Coefficients(q(x,n) + x^n-2*q(1/x,n))/4, where q(x, n) = d²*p(x, n)/dx² and p(x, n) = 2ⁿ*(1-x)ⁿ⁺¹*LerchPhi(x, -n, 1/2). A154706