ℕ atory
Play Now

Properties of the Number 8345

Eight Thousand Three Hundred Forty-Five

Basics

Value: 8344 → 8345 → 8346

Parity: odd

Prime: No

Previous Prime: 8329

Next Prime: 8353

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 5 × 1669

Divisors: 1, 5, 1669, 8345

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10000010011001

Octal: 20231

Duodecimal: 49B5

Hexadecimal: 2099

Square: 69639025

Square Root: 91.35097153287424

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

a(1) = 1; for n > 1, smallest digitally balanced number in base n. A49363
Least k such that the k-th maximal antirun of prime numbers > 3 has length n. Position of first appearance of n in A027833. The sequence ends if no such antirun exists. A373401
Array read by ascending antidiagonals: T(n,k) is the k-th positive integer that is digitally balanced in base n. A378000
Number of representations of n as a sum of products of pairs of positive integers, n = ∑k=1..m ik*jk with ik<=jk, ik<=ik+1, jk<=jk+1, ik*jk<=ik+1*jk+1. A212214
Digitally balanced numbers in base 6: equal numbers of 0's, 1's, ..., 5's. A49357
Number of subsets of {1..n} (including empty set) such that the pairwise GCDs of elements are not distinct. A196720
T(n,k) = Number of (n+1) X (k+1) 0..2 arrays with the difference of the upper and lower median value of each 2 X 2 subblock in lexicographically nondecreasing order rowwise and columnwise. A235565
Expansion of e.g.f. tanh(x·tan(x/2)) (even powers only). A296853
Number of non-constant integer partitions of n whose length and maximum both divide n. A326852
Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-1) + b(n-2) - n, where a(0) = 1, a(1) = 2, b(0) = 3, and (a(n)) and (b(n)) are increasing complementary sequences. A294553