Properties of the Number 13960

Thirteen Thousand Nine Hundred Sixty

Basics

Value: 13959 → 13960 → 13961

Parity: even

Prime: No

Previous Prime: 13933

Next Prime: 13963

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 ³ × 5 × 349

Divisors: 1, 2, 4, 5, 8, 10, 20, 40, 349, 698

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11011010001000

Octal: 33210

Duodecimal: 80B4

Hexadecimal: 3688

Square: 194881600

Square Root: 118.15244390193544

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 A(n,k) of partitions of the (n+k)-multiset {0,...,0,1,2,...,k} with n 0's; square array A(n,k), n>=0, k>=0, read by antidiagonals. A346426

Given M = triangle A122196 as an infinite lower triangular matrix, this sequence is lim_k->infinity M^k. A171238

E.g.f.: exp(10·x*G(x)⁹) / G(x)⁹ where G(x) = 1 + x·G(x)¹⁰ is the g.f. of A059968. A251580

Triangular array t read by rows: t(0,k) is p(k), the number of partitions of the k-multiset {0,0,...,0} with k zeros. For 0 <= n < k, t(n, k) is the number of partitions of the k-multiset {0, 0, ..., 0, 1, 2, 3, ..., k-n} with n zeros. A126442

Number of partitions of 2n into parts such that the largest multiplicity equals n. A232697

Number of partitions of n with unique smallest part and unique largest part. A117298

Starts of runs of 5 consecutive even numbers that are all totient numbers (A002202). A333022

The total number of ways of partitioning the multiset {1,1,1,1,2,3,...,n-3}. A169588

(A178476(n)-3)/9. A178486

Expansion of ∏_k=1..12 theta₃(q^k), where theta₃() is the Jacobi θ function. A320246