ℕ atory
Play Now

Properties of the Number 13216

Thirteen Thousand Two Hundred Sixteen

Basics

Value: 13215 → 13216 → 13217

Parity: even

Prime: No

Previous Prime: 13187

Next Prime: 13217

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 5 × 7 × 59

Divisors: 1, 2, 4, 7, 8, 14, 16, 28, 32, 56

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 11001110100000

Octal: 31640

Duodecimal: 7794

Hexadecimal: 33a0

Square: 174662656

Square Root: 114.96086290559931

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 length-n 0..k arrays with no following elements larger than the first repeated value. A267471
a(n) is the smallest nonnegative integer such that a(n)! contains a string of exactly n consecutive 9's. A254717
A simple grammar: power set of pairs of sequences. A52812
Number of ways to write n as an ordered sum of 8 nonzero triangular numbers. A340953
a(n) = number of steps to reach 0 when starting from k = n3 and repeatedly applying the map that replaces k with k - A055401(k), where A055401(k) = the number of positive cubes needed to sum to k using the greedy algorithm. A261227
At stage 1, start with a unit equilateral equiangular triangle. At each successive stage add 3*(n-1) new triangles around outside with edge-to-edge contacts. Sequence gives number of triangles (regardless of size) at n-th stage. A64412
Numbers k such that the odd part of σ(σ(k)) is equal to the odd part of σ(k). A353365
Number of signed trees with n nodes and p positive edges. Triangle T(n,p) read by rows, 0<=p<n. A302939
Number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 275", based on the 5-celled von Neumann neighborhood. A271091
Numbers k such that x=(σ(k) XOR 2·k) divides k in carryless binary arithmetic, when the binary expansions of k and·are interpreted as polynomials in ring GF(2)[X]. A379236