Properties of the Number 15916

Fifteen Thousand Nine Hundred Sixteen

Basics

Value: 15915 → 15916 → 15917

Parity: even

Prime: No

Previous Prime: 15913

Next Prime: 15919

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 ² × 23 × 173

Divisors: 1, 2, 4, 23, 46, 92, 173, 346, 692, 3979

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11111000101100

Octal: 37054

Duodecimal: 9264

Hexadecimal: 3e2c

Square: 253319056

Square Root: 126.15863030328127

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

Expansion of (χ(q) / χ³(q³))² in powers of q where χ() is a Ramanujan θ function. A164614

The number of closed normal form λ calculus terms of size n, where size(λ x.M)=2+size(M), size(M N)=2+size(M)+size(N), and size(V)=1+i for a variable V bound by the i-th enclosing λ (corresponding to a binary encoding). A195691

Expansion of (χ(-x) / χ³(-x³))² in powers of·where χ() is a Ramanujan θ function. A216046

T(n,k)=Equals two maps: number of nXk binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal, diagonal and antidiagonal neighbors in a random 0..2 nXk array. A220794

Number of partitions p of n such that the number of numbers having multiplicity 1 in p is a part of p. A241413

T(n,k)=Equals two maps: number of nXk binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal, diagonal and antidiagonal neighbors in a random 0..3 nXk array. A220959

Sum of the numbers already killed in the first jump of a Sieve of Eratosthenes table. A179628

Equals two maps: number of 2Xn binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal, diagonal and antidiagonal neighbors in a random 0..2 2Xn array. A220795

G.f. A(x) satisfies: A(x) = x * ∏_k>=1 (1 + A(x^k))/(1 - A(x^k)). A308368

a(n) = sum of minimal runlengths of all the partitions of n. A364808