Properties of the Number -23940

Twenty-Three Thousand Nine Hundred Forty

Basics

Value: -23941 → -23940 → -23939

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 ² × 3 ² × 5 × 7 × 19

Divisors: 1, 2, 3, 4, 5, 6, 7, 9, 10, 12

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

9108 Try Today's Challenge

Representations

Binary: -101110110000100

Octal: -56604

Duodecimal: -11A30

Hexadecimal: -5d84

Square: 573123600

Square Root: 154.72556349873153

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

Amicable triples: numbers such that σ(x) = σ(y) = σ(z) = x+y+z, x<y<z. We order these triples according to the common value of σ. Sequence gives·numbers. A125490

Number T(n,k) of primitive (= aperiodic) n-bead necklaces with colored beads of exactly k different colors; triangle T(n,k), n >= 0, 0 <= k <= n, read by rows. A254040

a(n) = n*(n+1)*(n+2)*(n+3)/6. A33488

Triangle read by rows: T(n,k) is the number of n-bead necklaces with exactly k different colored beads. A87854

a(n) = n*(n - 1)*(n + 2)/2. A77414

Triangle read by rows: T(n,k) = number of circuits of length k in the complete undirected graph on n labeled vertices, for n >= 1 and k = 0 .. n(n-1)/2. A357887

Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(1,1), d=(1,-2) and have k peaks (i.e., ud's). A108767

Triangle read by rows: T(n,k) (n >= 2, k >= 0) is the number of non-crossing connected graphs on n nodes on a circle, having k interior faces. Rows are indexed 2,3,4,...; columns are indexed 0,1,2,.... A89434

a(n) = ∑_k=0..n binomial(n+3·k+1,k). A390412

Numbers k such that 2k-1 divides 2^k-1. A81856