ℕ atory
Play Now

Properties of the Number 15840

Fifteen Thousand Eight Hundred Forty

Basics

Value: 15839 → 15840 → 15841

Parity: even

Prime: No

Previous Prime: 15823

Next Prime: 15859

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 5 × 3 2 × 5 × 11

Divisors: 1, 2, 3, 4, 5, 6, 8, 9, 10, 11

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 11110111100000

Octal: 36740

Duodecimal: 9200

Hexadecimal: 3de0

Square: 250905600

Square Root: 125.85706178041819

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

a(n) = σ(n) * A003961(n), where A003961 shifts the prime factorization of n one step towards larger primes, and σ is the sum of the divisors of n. A341529
A certain partition array in Abramowitz-Stegun order (A-St order), called M3(6). A134278
Number of integer compositions of n with the same length as their alternating sum. A357182
Strongly refactorable numbers: numbers n such that if n is divisible by d, it is divisible by the number of divisors of d. A141586
Number of triangular regions in regular n-gon with all diagonals drawn. A62361
Numbers n that raised to the powers from 1 to k (with k>=1) are multiple of the sum of their digits (n raised to k+1 must not be a multiple). Case k=10. A135195
Number of n-step walks on square lattice in the first quadrant which finish at distance n-3 from the x-axis. A5564
Max{ k!/(a(1)!*a(2)!*..*a(n)!) : a(1) + 2·a(2) + 3·a(3) + ... + n·a(n) = n, a(1) + a(2) + ... + a(n) = k }. A102462
Triangle read by rows: T(n,k) = number of closed trails of length k starting and ending at a fixed vertex in the complete undirected graph on n labeled vertices, for n >= 1 and k = 0 .. n(n-1)/2. A357885
Triangle read by rows: T(n,k) = number of circuits of length k in the complete undirected graph on n labeled vertices, for n >= 1 and k = 0 .. n(n-1)/2. A357887