Properties of the Number -9351

Three Hundred Fifty-One

Basics

Value: -9352 → -9351 → -9350

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 1039

Divisors: 1, 3, 9, 1039, 3117, 9351

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -10010010000111

Octal: -22207

Duodecimal: -54B3

Hexadecimal: -2487

Square: 87441201

Square Root: 96.70056876771719

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

G.f. satisfies A(x) = exp( ∑_k>=1 (3 * (-1)^k + A(x^k)) * x^k/k ). A363566

a(n) = a(n-1) + a(n-2) - 2, a(0) = 4, a(1) = 3. A211

Number T(n,k) of (unlabeled) rooted trees with n leaf nodes and without unary nodes such that k is the maximum of 1 and the node outdegrees; triangle T(n,k), n>=1, 1<=k<=n, read by rows. A292086

a(1) = 3; a(n) is smallest number > a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime. A74339

a(1)=1; thereafter, a(n) is the smallest number such that both the addition and multiplication tables for (a(1),...,a(n)) contain n*(n+1)/2 different entries (the maximum possible). A337655

Integers j not of form 3m+2 such that for any integer k > 0, j·10^k+1 has a divisor in the set { 7, 11, 13, 37 }. A243969

Number of maximum matchings in the n-Moebius ladder M_n. A20878

Start with 1013 and repeatedly reverse the digits and add 2 to get the next term. A120214

The (2ⁿ)-th composite number. A65856

Numbers that end in (..., 175, 175, 175, ...) under the rule: next term = product of the last four digits in the sequence so far. A239721