Properties of the Number 15987

Fifteen Thousand Nine Hundred Eighty-Seven

Basics

Value: 15986 → 15987 → 15988

Parity: odd

Prime: No

Previous Prime: 15973

Next Prime: 15991

Digit Sum: 30

Digital Root: 3

Palindrome: No

Factorization: 3 × 73 ²

Divisors: 1, 3, 73, 219, 5329, 15987

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 11111001110011

Octal: 37163

Duodecimal: 9303

Hexadecimal: 3e73

Square: 255584169

Square Root: 126.43970895252804

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

3p² where p runs through the primes. A79705

Numbers that are the sum of three squares in arithmetic progression. A292313

3·h², where h is an odd integer not divisible by 3. A229852

a(n) = ∑_k=1..n σ(k)*σ(2·k), where σ(n) = A000203(n) is the sum of the divisors of n. A347108

Numbers of the form p²*q, with odd primes p > q, such that q divides p-1. A350638

a(n) is the number of complement pairs of imprimitive (periodic) 2n-bead balanced binary necklaces. A387130

The maximal norm of an additively indecomposable element in Shanks' simplest cubic field Q[x]/(x³ - n·x² - (n+3)*x - 1). A387575

Numbers k such that σ(k) = ψ(k) + ω(k)². A390251

Composite numbers n such that 8·n²-2·n-1 divides the primitive part U(n) of Fibonacci(n). A159234

Number of partitions of n*(n-1)/2 into at most three parts. A274233