Properties of the Number 8307

Eight Thousand Three Hundred Seven

Basics

Value: 8306 → 8307 → 8308

Parity: odd

Prime: No

Previous Prime: 8297

Next Prime: 8311

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 13 × 71

Divisors: 1, 3, 9, 13, 39, 71, 117, 213, 639, 923

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 10000001110011

Octal: 20163

Duodecimal: 4983

Hexadecimal: 2073

Square: 69006249

Square Root: 91.14274518577987

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

T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 2 3 4 6 or 7 and every 3X3 column and antidiagonal sum not equal to 2 3 4 6 or 7. A252407

E.g.f.: A(x,y) = exp(-1-y) * ∑_n>=0 (exp(n·x) + y)ⁿ / n!, where A(x,y) = ∑_n>=0 xⁿ/n! * ∑_k=0..n T(n,k)*y^k, as a triangle of coefficients T(n,k) read by rows. A326600

Fibonacci sequence beginning 1, 13. A22103

a(n) = n·F(n) + (n-1)*F(n-1). A136376

Numbers k for which A354102(k) = A354102(σ(k)). A354106

Heinz numbers of integer partitions whose LCM is twice their sum. A327775

a(n) = 49·n² + 2·n. A157365

Numbers n such that n² + 1 is divisible by a 4th power. A218563

a(n) is the total number of down steps between the 2nd and 3rd up steps in all 2-Dyck paths of length 3·n. A 2-Dyck path is a nonnegative lattice path with steps (1, 2), (1, -1) that starts and ends at y = 0. A334640

Non-seed μ-atoms of period n in Mandelbrot set. A6875