Properties of the Number 1316

One Thousand Three Hundred Sixteen

Basics

Value: 1315 → 1316 → 1317

Parity: even

Prime: No

Previous Prime: 1307

Next Prime: 1319

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 2 ² × 7 × 47

Divisors: 1, 2, 4, 7, 14, 28, 47, 94, 188, 329

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10100100100

Octal: 2444

Duodecimal: 918

Hexadecimal: 524

Square: 1731856

Square Root: 36.27671429443411

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

Describe n. Also called the "Say What You See" or "Look and Say" sequence LS(n). A45918

Euler transform of σ(n), cf. A000203. A61256

a(n) = n*(n+9)/2. A56000

Describe n (count digits in order of increasing value, ignoring missing digits). A47842

Numbers n such that (5+n!)/5 is prime. A139058

a(n) = T(n, n-4), T given by A026519. Also a(n) = number of integer strings s(0), ..., s(n), counted by T, such that s(n) = 4. A26524

Numbers m such that there are precisely 9 groups of order m. A249552

Numbers k such that binomial(2k,k)+1 is prime. A66699

a(n) = T(n, n-4), T given by A026552. Also a(n) = number of integer strings s(0),...,s(n) counted by T, such that s(n)=4. A26557

Triangle T, read by rows, equal to a diagonal bisection of A118032 such that diagonal n of T equals diagonal 2n+1 of A118032: T(n,k) = A118032(2n+1-k,k); also equals the matrix product of A118032 and SHIFT_UP(A118032). A118045