Properties of the Number 6897

Six Thousand Eight Hundred Ninety-Seven

Basics

Value: 6896 → 6897 → 6898

Parity: odd

Prime: No

Previous Prime: 6883

Next Prime: 6899

Digit Sum: 30

Digital Root: 3

Palindrome: No

Factorization: 3 × 11 ² × 19

Divisors: 1, 3, 11, 19, 33, 57, 121, 209, 363, 627

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 1101011110001

Octal: 15361

Duodecimal: 3BA9

Hexadecimal: 1af1

Square: 47568609

Square Root: 83.04817878797824

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 rucksack partitions of n: every consecutive constant subsequence has a different sum. A353864

a(n) = σ(n) * A003961(n), where A003961 shifts the prime factorization of n one step towards larger primes, and σ is the sum of the divisors of n. A341529

a(n) = ∑_d∣3 φ(d)*n^3/d. A54602

15-gonal (or pentadecagonal) numbers: n*(13n-11)/2. A51867

a(0) = 1, a(1) = 19; for n > 1, a(n) = 19·a(n-1) + a(n-2). A243399

Numbers that are not a power of a prime but whose prime indices satisfy (mean) = (median) = (mode), assuming there is a unique mode. A363729

Numbers primitive with respect to having more than one factorization into S-primes. See related sequences for definition. A57950

Sequence is {a(7,n)}, where a(m,n) is defined in sequence A110665. A110672

Root of the upper member A340701 of a pair of adjacent perfect powers, both with exponents > 2. A340703

Triangle T(n, k, m) = t(n,m)/( t(k,m) * t(n-k,m) ) with T(n, 0, m) = T(n, n, m) = 1, where t(n, m) = ∏_j=1..n ∏_i=1..j-1 ( 1 - (m+1)*(2·i-1) ) and m = 3, read by rows. A156698