Properties of the Number -18993

Eighteen Thousand Nine Hundred Ninety-Three

Basics

Value: -18994 → -18993 → -18992

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 30

Digital Root: 3

Palindrome: No

Factorization: 3 × 13 × 487

Divisors: 1, 3, 13, 39, 487, 1461, 6331, 18993

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8109 Try Today's Challenge

Representations

Binary: -100101000110001

Octal: -45061

Duodecimal: -ABA9

Hexadecimal: -4a31

Square: 360734049

Square Root: 137.81509351301113

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

First term of the n-th differences of the powers of primes. Inverse zero-based binomial transform of A000961. A377054

G.f. A(x) defined by: A(x)² consists entirely of integer coefficients between 1 and 2 (A083952); A(x) is the unique power series solution with A(0)=1. A84202

T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having directed index change 0,0 0,1 1,0 -1,0 or 0,-2. A264217

G.f. satisfies A(x) = 1 + x·A(x)² * (1 + x·A(x)²)². A367282

Ordered factorizations with one level of parentheses indexed by prime signatures. A050354(A025487). A50355

Number of (1+1) X (n+1) arrays of permutations of 0..n·2+1 with each element having directed index change 0,0 0,1 1,0 -1,0 or 0,-2. A264218