Properties of the Number 6388

Six Thousand Three Hundred Eighty-Eight

Basics

Value: 6387 → 6388 → 6389

Parity: even

Prime: No

Previous Prime: 6379

Next Prime: 6389

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 ² × 1597

Divisors: 1, 2, 4, 1597, 3194, 6388

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100011110100

Octal: 14364

Duodecimal: 3844

Hexadecimal: 18f4

Square: 40806544

Square Root: 79.92496481075234

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

Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-2), where a(0) = 1, a(1) = 2, b(0) = 3. A294532

Fibonacci sequence beginning 0, 4. A22087

Number of (directed) Hamiltonian paths in the n-ladder graph. A137882

Number of integer partitions of n whose median part is the smallest. A361860

Number of fixed points of mirroring operation on solid partitions. A96573

a(n) = ∑_{k=0..floor(n/2)} T(n-k,k), T given by A026758. A26768

T(n,k)=Number of nXk binary arrays with each 1 adjacent to exactly one 0 vertically and one 0 horizontally. A183352

Number of subsets A of {0,1,...,n-1} with |A+A| > |A-A|. A222807

Convolution of A000010 with itself. A65093

Let S be the sequence Fibonacci(2n), n>0 (cf. A001906); sequence lists the differences S(j)-S(i) for i<j. A169690