Properties of the Number -19868

Nineteen Thousand Eight Hundred Sixty-Eight

Basics

Value: -19869 → -19868 → -19867

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 32

Digital Root: 5

Palindrome: No

Factorization: 2 ² × 4967

Divisors: 1, 2, 4, 4967, 9934, 19868

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -100110110011100

Octal: -46634

Duodecimal: -B5B8

Hexadecimal: -4d9c

Square: 394737424

Square Root: 140.9538931707812

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

T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 3 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. A302965

Number of binary strings of length n avoiding "squares" (that is, repeated blocks of the form xx) with |x| > 3. A230177

Triangle read by rows: T(n,k) number of ways of partitioning the (n+5)-element multiset {1,1,1,1,1,1,2,3,...,n} into exactly k nonempty parts, n >= 0 and 1 <= k <= n + 5. A291120

Numbers k such that h(k) = h(k-1) + h(k-2), where h(k) = A006577(k) + 1 is the length of the sequence {k, f(k), f(f(k)), ...., 1} in the Collatz (or 3x + 1) problem. (The earliest "1" is meant.) A78418

Solution to the non-squashing boxes problem (version 2). A89055

Triangle of optimist numbers T(n,k) (n >= 1, 0 <= k <= n-1) read by rows: permutations needing k steps to be sorted by the "optimist" algorithm. A345453

Third convolution of A001405 (central binomial numbers). A54443

Number of standard Young tableaux with n cells and exactly seven successions. A241778

Number of standard Young tableaux with 2n cells and exactly n successions. A241785

Number of nX6 0..1 arrays with every element equal to 0, 1, 2, 3 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. A302963