Properties of the Number -40908

Forty Thousand Nine Hundred Eight

Basics

Value: -40909 → -40908 → -40907

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 ² × 3 × 7 × 487

Divisors: 1, 2, 3, 4, 6, 7, 12, 14, 21, 28

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7989 Try Today's Challenge

Representations

Binary: -1001111111001100

Octal: -117714

Duodecimal: -1B810

Hexadecimal: -9fcc

Square: 1673464464

Square Root: 202.25726192154386

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

Sum of 11 positive 9th powers. A4800

Triangle read by rows where T(n,k) is the number of labeled loop-graphs on n vertices with k loops and n-k non-loops such that it is possible to choose a different vertex from each edge. A368924

T(n,k)=Number of nXk 0..3 arrays with some element plus some horizontally or vertically adjacent neighbor totalling three no more than once. A269109

Smith numbers of order 3. A178213

Number of length n binary words that contain 000 and 001 and 010 and 011 and 100 and 101 and 110 and 111 as contiguous subsequences. The 3 letter subsequences are allowed to overlap. A242167

Triangle read by rows. T(n, k) = A000566(n - k + 1) * T(n, k - 1) + T(n - 1, k) for 0 < k < n. T(n, 0) = 1 and T(n, n) = T(n, n - 1) if n > 0. A366149

Number of sets of nonempty words with a total of n letters over ternary alphabet containing the third letter such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter. A293884

a(n) = ∑_{k<n, k≠=0 (mod n)} k!/n. A110416

Number of n X n 0..3 arrays with some element plus some horizontally or vertically adjacent neighbor totalling three no more than once. A269102

Number of n X 3 0..3 arrays with some element plus some horizontally or vertically adjacent neighbor totalling three no more than once. A269104