Properties of the Number 12815

Twelve Thousand Eight Hundred Fifteen

Basics

Value: 12814 → 12815 → 12816

Parity: odd

Prime: No

Previous Prime: 12809

Next Prime: 12821

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 5 × 11 × 233

Divisors: 1, 5, 11, 55, 233, 1165, 2563, 12815

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11001000001111

Octal: 31017

Duodecimal: 74BB

Hexadecimal: 320f

Square: 164224225

Square Root: 113.20335684068738

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

Iccanobif numbers: reverse digits of two previous terms and add. A1129

Number of polyominoes with n cells, symmetric about diagonal 2. A56878

Triangle Q, read by rows, such that Q³ transforms column k of Q² into column k+1 of Q², so that column k of Q² equals column 0 of Q^3·k+2, where Q³ denotes the matrix cube of Q. A113381

Number of n X 1 0..4 arrays with each element·equal to the number its horizontal and vertical neighbors equal to 2,0,1,3,4 for x=0,1,2,3,4. A195971

a(n) = F(n)*F(n-1) if n odd otherwise F(n)*F(n-1)-1, where F = Fibonacci numbers A000045. A59840

T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having index change +-(.,.) 0,0 0,1 or 2,-2. A264090

Number of partitions of n containing a clique of size 7. A183564

a(n) = F(n)² - F(n-1)² or F(n+1) * F(n-2) where F(n) = A000045(n), the Fibonacci numbers. A226205

a(n) = 7·a(n-1) - a(n-2) + 4, with a(0) = 0, a(1) = 5. A3482

Triangle, read by rows, given by the product R³*Q^-2 using triangular matrices Q=A113381, R=A113389. A114154