Properties of the Number 15968

Fifteen Thousand Nine Hundred Sixty-Eight

Basics

Value: 15967 → 15968 → 15969

Parity: even

Prime: No

Previous Prime: 15959

Next Prime: 15971

Digit Sum: 29

Digital Root: 2

Palindrome: No

Factorization: 2 ⁵ × 499

Divisors: 1, 2, 4, 8, 16, 32, 499, 998, 1996, 3992

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11111001100000

Octal: 37140

Duodecimal: 92A8

Hexadecimal: 3e60

Square: 254977024

Square Root: 126.36455199145051

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 integer partitions of n whose run-lengths are not unimodal. A332281

Somos's sequence {a(7,n)} defined in comment in A018896: a(0)=a(1)= ... = a(15) = 1; for n>=16, a(n) = (a(n-1)*a(n-15)+ a(n-8)²)/a(n-16). A271837

Sum of the first 2n+1 primes. A109723

Breadth-first-wise A014486-like encoding of A080299-trees. A80313

a(n) = a(n-1) + 2·a(n-2) - a(n-3) - a(n-4), a(0)=0, a(1)=8, a(2)=10, a(3)=18. A153382

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

E.g.f. satisfies: A(x) = (exp(x·A(x)) + exp(x/A(x)))/2. A195510

Sum of first prime(n) primes. A22094

Numbers of the form 5^j + 7^k, for j and k >= 0. A226818

a(n) = (1/2) * ∑_{k=0..floor(n/3)} 2^n-2·k * binomial(2·n-4·k+2,2·k+1). A387602