Properties of the Number 13202

Thirteen Thousand Two Hundred Two

Basics

Value: 13201 → 13202 → 13203

Parity: even

Prime: No

Previous Prime: 13187

Next Prime: 13217

Digit Sum: 8

Digital Root: 8

Palindrome: No

Factorization: 2 × 7 × 23 × 41

Divisors: 1, 2, 7, 14, 23, 41, 46, 82, 161, 287

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

603 Try Today's Challenge

Representations

Binary: 11001110010010

Octal: 31622

Duodecimal: 7782

Hexadecimal: 3392

Square: 174292804

Square Root: 114.8999564838908

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

a(n) = (n-1)*n*(n+4)/6. A5581

Number of reduced words of length n in the Weyl group D₄₂. A162411

a(n) = 2·n*(4·n-3). A139271

Squarefree integers m > 1 such that if prime p divides m, then s_p(m) >= p and s_p(m) == 2 (mod p-1), where s_p(m) is the sum of the base p digits of m. A324404

A014486-codes for the Beanstalk-tree growing one natural number at time, starting from the tree of one internal node (1), with the "lesser numbers to the left hand side" construction. A218776

Expansion of f(-x) * ψ(x²) * φ(x³) / f(-x³)³ in powers of·where φ(), ψ(), f() are Ramanujan θ functions. A230256

A014486-encoding of plane binary trees (Stanley's d) whose interior zigzag-tree (Stanley's c, i.e., tree obtained by discarding the outermost edges of the binary tree) is isomorphic to a valid plane binary tree (Stanley's d). A80299

a(0) = 2 and, for n >= 1, rewrite 0->100 in the binary expansion of n and append 10 to the right. A80310

G.f.: (1 + 5·x + 5·x² + x³)/∏_i=1..10 (1 - xⁱ). A256977

a(n) = A014486(A154472(n)). A154473