ℕ atory
Play Now

Properties of the Number -15795

Fifteen Thousand Seven Hundred Ninety-Five

Basics

Value: -15796 → -15795 → -15794

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 3 5 × 5 × 13

Divisors: 1, 3, 5, 9, 13, 15, 27, 39, 45, 65

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -11110110110011

Octal: -36663

Duodecimal: -9183

Hexadecimal: -3db3

Square: 249482025

Square Root: 125.67816039392046

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, k) = (m·k)! [xk] MittagLefflerE(m, x)-n, for m = 3, n >= 0, k >= 0; square array read by descending antidiagonals. A326475
T(n,k) = number of defective 3-colorings of an n X k 0..2 array connected horizontally, diagonally and antidiagonally with exactly two mistakes, and colors introduced in row-major 0..2 order. A229637
T(n,k) = number of defective 3-colorings of an n X k 0..2 array connected horizontally and vertically with exactly two mistakes, and colors introduced in row-major 0..2 order. A229606
Square array read by antidiagonals downwards: super Patalan numbers of order 3. A248324
Strings of 5 digits from 1...9, such that no formula using the single digits in the given order exists that evaluates to 0. A288355
Sum of all the parts in the partitions of n into 5 squarefree parts. A308839
Number of ordered rooted trees with n non-root nodes and all outdegrees <= five. A36767
Number of partitions p of n such that the number of parts is a part and max(p) - min(p) is not a part. A241384
Denominators of coefficients of asymptotic expansion of probability p(n) (see A002816) in powers of 1/n. A78631
Number of different ways to select n elements from three sets of n elements such that there is at least one element from each set. A115246