Properties of the Number 6393

Six Thousand Three Hundred Ninety-Three

Basics

Value: 6392 → 6393 → 6394

Parity: odd

Prime: No

Previous Prime: 6389

Next Prime: 6397

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 2131

Divisors: 1, 3, 2131, 6393

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100011111001

Octal: 14371

Duodecimal: 3849

Hexadecimal: 18f9

Square: 40870449

Square Root: 79.95623803056269

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 strict integer partitions of n whose product of parts is a multiple of n. A379733

Number A(n,k) of partitions of the (n+k)-multiset {0,...,0,1,2,...,k} with n 0's; square array A(n,k), n>=0, k>=0, read by antidiagonals. A346426

G.f.: exp( ∑_n>=1 xⁿ * (1+x)ⁿ / (n*(1-xⁿ)) ). A227681

a(1) = 4; a(n) is smallest number >= a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime. A46254

Least m such that 1 + prime(n)*2^m is a prime, or -1 if no such m exists. A57192

Minimal exponents m such that the fractional part of (1024/1000)^m obtains a maximum (when starting with m=1). A153679

a(n) = 4·a(n-1) - a(n-2) for n>1, a(0)=3, a(1)=9. A82841

Numbers k such that the fractional part of (1024/1000)^k is greater than 1-(1/k). A153680

Triangular array t read by rows: t(0,k) is p(k), the number of partitions of the k-multiset {0,0,...,0} with k zeros. For 0 <= n < k, t(n, k) is the number of partitions of the k-multiset {0, 0, ..., 0, 1, 2, 3, ..., k-n} with n zeros. A126442

a(n) = 3·n² + n - 1. A144391