Properties of the Number 15990

Fifteen Thousand Nine Hundred Ninety

Basics

Value: 15989 → 15990 → 15991

Parity: even

Prime: No

Previous Prime: 15973

Next Prime: 15991

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 2 × 3 × 5 × 13 × 41

Divisors: 1, 2, 3, 5, 6, 10, 13, 15, 26, 30

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11111001110110

Octal: 37166

Duodecimal: 9306

Hexadecimal: 3e76

Square: 255680100

Square Root: 126.45157175772866

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

Matula-Goebel numbers of transitive rooted identity trees (or transitive finitary sets). A290760

a(n) = floor(n*(n-1)*(n-2)/4). A11886

a(n) = 2·binomial(9·n+6,n)/(3·n+2). A234509

Denominator of c(n) = (n²+n+2)/((n+1)*(n+2)*(n+3)). A241269

Array read by antidiagonals: T(n,k) is the number of connected graphs on n labeled nodes, each node being colored with one of k colors, where no edge connects two nodes of the same color. A322279

Smallest ∏_i:λ prime(i) for any complete partition λ of n. A259941

a(n) = ∑_k=1..n k² * floor(n/k)². A350123

Number of connected graphs on n labeled nodes, each node being colored with one of 3 colors, such that no edge joins nodes of the same color. A2028

a(n) = n*(19·n + 1)/2. A22277

a(n) = rad(n(n+1)(n+2)), where rad(m) is the largest squarefree number dividing m (see A007947). A78637