Properties of the Number -19302

Nineteen Thousand Three Hundred Two

Basics

Value: -19303 → -19302 → -19301

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 × 3 × 3217

Divisors: 1, 2, 3, 6, 3217, 6434, 9651, 19302

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -100101101100110

Octal: -45546

Duodecimal: -B206

Hexadecimal: -4b66

Square: 372567204

Square Root: 138.93163786553444

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) = 2ⁿ * ∑_k=0..n k^p*q^k, where p=2, q=-1/2. A232603

Expansion of e.g.f. exp(exp(exp(x)-1)-1). A258

Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where the e.g.f. of column k is 1+g^k+1(x) with g = x-> exp(x)-1. A144150

Triangle read by rows: matrix cube of the Stirling2 triangle A008277. A39811

Array T(n,k) = A153277(n-1,k) = A144150(n,k-1) read by downwards antidiagonals. A111672

Array read by antidiagonals of higher order Bell numbers. A153277

a(n) = 27·n²/2 + 45·n/2 - 12 (n>=1). A304375

Number of unlabeled balanced rooted semi-identity trees with 2n-1 nodes and depth n. A306274

a(n) = ∑_k=0..n n^k * binomial(2·n,n-k). A371825

a(n)= 3·a(n-3) +3·a(n-6) +a(n-9). A109530