ℕ atory
Play Now

Properties of the Number 8368

Eight Thousand Three Hundred Sixty-Eight

Basics

Value: 8367 → 8368 → 8369

Parity: even

Prime: No

Previous Prime: 8363

Next Prime: 8369

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 4 × 523

Divisors: 1, 2, 4, 8, 16, 523, 1046, 2092, 4184, 8368

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10000010110000

Octal: 20260

Duodecimal: 4A14

Hexadecimal: 20b0

Square: 70023424

Square Root: 91.47677300823418

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

Triangle T(n, k, m) = (m*(n-k) + 1)*T(n-1, k-1, m) + (m·k + 1)*T(n-1, k, m) + m·f(n,k)*T(n-2, k-1, m) with T(n, 0, m) = T(n, n, m) = 1, f(n, k) = k if k <= floor(n/2) otherwise n-k, and m = 3, read by rows. A157209
Total number of Fibonacci parts in all partitions of n. A144115
T(n,k)=Number of nXk 0..3 arrays with every element equal to either the sum mod 4 of its vertical neighbors or the sum mod 4 of its horizontal neighbors. A183492
Triangle T(n,k) of the numbers of nodes in all non-extendable (complete) non-self-adjacent simple paths within a square lattice bounded by rectangles with nodal dimensions n and k, n >= k >= 2. A214397
Susceptibility series H2 for 2-dimensional Ising model (divided by 2). A54275
T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 3, 6 or 7 king-move adjacent elements, with upper left element zero. A299180
Number of integer partitions of n whose nonzero first differences are a submultiset of the parts. A364675
Numbers k such that 3k mod k = 3k mod k2. A125774
Number of compositions of n such that the cardinality of the set of parts is 2. A131661
Number of ways to choose three distinct points from a 5 X n grid so that they form an isosceles triangle. A271915