Properties of the Number 15872

Fifteen Thousand Eight Hundred Seventy-Two

Basics

Value: 15871 → 15872 → 15873

Parity: even

Prime: No

Previous Prime: 15859

Next Prime: 15877

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 2 ⁹ × 31

Divisors: 1, 2, 4, 8, 16, 31, 32, 62, 64, 124

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11111000000000

Octal: 37000

Duodecimal: 9228

Hexadecimal: 3e00

Square: 251920384

Square Root: 125.98412598418898

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 alternating permutations of order n. A1250

a(n) = n*(n+1)²/2. A6002

Numbers that are divisible by exactly 10 primes with multiplicity. A46314

Abundant numbers n for which the abundance d = σ(n) - 2·n is a proper divisor, that is, 0 < d < n and d | n. A181595

Triangle of Euler-Bernoulli or Entringer numbers read by rows: T(n,k) is the number of down-up permutations of n+1 starting with k+1. A8282

Numbers of the form q*(2^k), where q is one of the Mersenne primes (A000668) and k >= 0. A335431

Shanks's array c_a,n (a >= 1, n >= 0) that generalizes Euler and class numbers, read by antidiagonals upwards. A235605

Triangle read by rows: number of permutations of 1..n by length of longest run. A10026

Triangle read by rows: number of permutations of 1..n by length l of longest run (n >= 1, 1 <= l <= n). A211318

Abundant numbers n such that n/(σ(n)-2n) is an integer. A153501