Properties of the Number -15183

Fifteen Thousand One Hundred Eighty-Three

Basics

Value: -15184 → -15183 → -15182

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 7 × 241

Divisors: 1, 3, 7, 9, 21, 63, 241, 723, 1687, 2169

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -11101101001111

Octal: -35517

Duodecimal: -8953

Hexadecimal: -3b4f

Square: 230523489

Square Root: 123.2193166674771

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

T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 4 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. A302728

Related to enumeration of edge-rooted catafusenes. A39658

G.f. satisfies: A(x)² = A( x²/(1 - 4·x + 2·x²) ). A274484

a(n) = ∑_k=1..n C(n,k)³ where C(n,k) is binomial(n,k). A96191

Triangle read by rows: T(n,k) is the number of skew Dyck paths of semilength n and having k UDL's (n >= 0; 0 <= k <= floor((n+1)/2)). A128728

Engel expansion of the positive root of x^x^x^x = 2. A225208

Number of nonequivalent minimal total dominating sets in the n-cycle graph up to rotation. A302918

Number of skew Dyck paths of semilength n with no UDL's. A128729

Number of (n+3) X 8 0..1 matrices with each 4 X 4 subblock idempotent. A224565

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 454", based on the 5-celled von Neumann neighborhood. A272278