Properties of the Number -23988

Twenty-Three Thousand Nine Hundred Eighty-Eight

Basics

Value: -23989 → -23988 → -23987

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 30

Digital Root: 3

Palindrome: No

Factorization: 2 ² × 3 × 1999

Divisors: 1, 2, 3, 4, 6, 12, 1999, 3998, 5997, 7996

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -101110110110100

Octal: -56664

Duodecimal: -11A70

Hexadecimal: -5db4

Square: 575424144

Square Root: 154.88059917239474

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=0..n 9^n-k * binomial(n+k-1,k) * binomial(k/3,n-k). A378555

Floor of the expected value of number of trials until exactly five cells are empty in a random distribution of n balls in n cells. A210116

Number of 2 X 2 matrices having all elements in {0,1,...,n} and determinant = 1 (mod 3). A211034

Same triangle as A106243, but with rows read in boustrophedon manner, i.e., in the order in which they were created. A106242

On a spirally numbered square grid, with labels starting at 1, this is the number of steps that an (n,n+1) leaper makes before getting trapped, or -1 if it never gets trapped. A343178

Triangle read by rows from left to right. However, triangle is constructed in the boustrophedon way, reading alternately right to left and left to right. Top entry is 1. In all later rows, initial entry is 0, other entries are sum of previous entry in that row plus sum of two entries above it in previous row. A106243

Number of (n+2) X 3 binary arrays avoiding patterns 001 and 110 in rows, columns and nw-to-se diagonals. A202440

Expansion of ∏_k>=0 (1+x^3·k+1)⁴. A261637

a(n) is the least k such that 3^k == A047471(n) (mod 2^A047471(n)). A339774

Number of permutations of 1..n with all differences of elements separated by distances 1 through 7 being respectively unique. A170813