Properties of the Number -88368

Eighty-Eight Thousand Three Hundred Sixty-Eight

Basics

Value: -88369 → -88368 → -88367

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 33

Digital Root: 6

Palindrome: No

Factorization: 2 ⁴ × 3 × 7 × 263

Divisors: 1, 2, 3, 4, 6, 7, 8, 12, 14, 16

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -10101100100110000

Octal: -254460

Duodecimal: -43180

Hexadecimal: -15930

Square: 7808903424

Square Root: 297.2675562519395

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

Number of binary words of length n containing no subword 11011. A210021

Number T(n,k) of binary words of length n containing exactly k (possibly overlapping) occurrences of the subword 11011; triangle T(n,k), n>=0, k=0..max(0,floor((n-2)/3)), read by rows. A277678

Square array A(n,k), n>=0, k>=0, read by antidiagonals downwards, where column k is the expansion of e.g.f. 1/(1 - x*(exp(x) - 1)^k). A392817

Expansion of e.g.f. 1/(1 - x*(exp(x) - 1)²). A392820

Number of n-length words w over ternary alphabet such that for every prefix z of w we have #(z,a_i) = 0 or #(z,a_i) >= #(z,a_j) for all j>i and #(z,a_i) counts the occurrences of the i-th letter in z. A213291