Properties of the Number 8397

Eight Thousand Three Hundred Ninety-Seven

Basics

Value: 8396 → 8397 → 8398

Parity: odd

Prime: No

Previous Prime: 8389

Next Prime: 8419

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 3 ³ × 311

Divisors: 1, 3, 9, 27, 311, 933, 2799, 8397

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10000011001101

Octal: 20315

Duodecimal: 4A39

Hexadecimal: 20cd

Square: 70509609

Square Root: 91.63514609580758

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 complete partitions of n. A126796

Least k such that there are exactly n ways to choose a sequence of divisors, one of each element of the multiset of prime indices of k (with multiplicity). A355732

Number of pairings of the first 2n positive integers so that the absolute differences of each pair are different. A60963

Composite numbers k such that binomial(3·k, k) == 3^k (mod k). A80469

Number of ways to write n as an ordered sum of 6 squarefree numbers. A341066

Triangle T(n, k) = coefficients of ( t(n, x) ) where t(n, x) = (1-x)ⁿ⁺¹*p(n, x)/x, p(n, x) = x·D( p(n-1, x) ), with p(1, x) = x/(1-x)², p(2, x) = x*(1+x)/(1-x)³, and p(3, x) = x*(1+10·x+x²)/(1-x)⁴, read by rows. A166341

a(n) = n*(23·n + 1)/2. A22281

Numbers k such that gcd(k, reverse(k)) = 27 = 3³, where reverse(x) = A004086(x). A72016

Least k such that there are exactly n ways to choose a sequence of divisors, one of each prime index of k (with multiplicity), such that the result has no common divisor > 1. A355738

Numbers n such that both n⁴ + 2 and n⁴ - 2 are prime. A71351