Properties of the Number 13696

Thirteen Thousand Six Hundred Ninety-Six

Basics

Value: 13695 → 13696 → 13697

Parity: even

Prime: No

Previous Prime: 13693

Next Prime: 13697

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 ⁷ × 107

Divisors: 1, 2, 4, 8, 16, 32, 64, 107, 128, 214

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 11010110000000

Octal: 32600

Duodecimal: 7B14

Hexadecimal: 3580

Square: 187580416

Square Root: 117.02991070662235

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 partitions with no even part repeated; partitions of n in which no parts are multiples of 4. A1935

Expansion of ψ(x) / φ(x) in powers of·where φ(), ψ() are Ramanujan θ functions. A83365

Products of the 7th power of a prime and a distinct prime (p⁷*q). A179664

Number of n-step self-avoiding nonintersecting walks on the square lattice with diagonals allowed (corresponds to using the Moore neighborhood). A272773

a(n) = n²*(7·n - 5)/2. A262000

a(n) is the number of vertices in the diagram of partitions of n (see example). A299475

Number of permutations of [n] whose lengths of increasing runs are distinct prime numbers. A317447

Infinitary Zumkeller numbers (A335197) whose set of infinitary divisors can be partitioned into two disjoint sets of equal sum in a single way. A335199

Number of partitions of 2n+1 in which no parts are multiples of 4. A81056

G.f.: A(x) = exp( 2*∑_n>=1 σ(n)*A006519(n) * xⁿ/n ), where A006519(n) = highest power of 2 dividing n. A162584