Properties of the Number 8362

Eight Thousand Three Hundred Sixty-Two

Basics

Value: 8361 → 8362 → 8363

Parity: even

Prime: No

Previous Prime: 8353

Next Prime: 8363

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 × 37 × 113

Divisors: 1, 2, 37, 74, 113, 226, 4181, 8362

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10000010101010

Octal: 20252

Duodecimal: 4A0A

Hexadecimal: 20aa

Square: 69923044

Square Root: 91.44397191723465

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 binary vectors of length n containing no singletons. A6355

Number of base 4 n-digit numbers with adjacent digits differing by one or less. A126358

Layer counting sequence for hyperbolic tessellation by cuspidal triangles of angles (π/3,π/3,0) (this is the classical modular tessellation). A54886

Number of n-digit numbers N that do not end with 0 and are such that the reversal of N divides N but is different from N. A214927

Coordination sequence for (2,5,6) tiling of hyperbolic plane. A265065

a(n) = τ(n)*Fibonacci(n), where τ(n) = A000005(n), the number of divisors of n. A203847

Expansion of g.f. x*(1+x+x²)/(1-x-x²). A128588

a(0) = 1, then twice the Fibonacci sequence. A55389

Row sums of array T in A055818; twice the odd-indexed Fibonacci numbers after initial term. A55819

a(n) = 2·F(n-1) = L(n) - F(n), where F(n) and L(n) are Fibonacci and Lucas numbers respectively. A118658