Properties of the Number -9302

Three Hundred Two

Basics

Value: -9303 → -9302 → -9301

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 × 4651

Divisors: 1, 2, 4651, 9302

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -10010001010110

Octal: -22126

Duodecimal: -5472

Hexadecimal: -2456

Square: 86527204

Square Root: 96.44687656943589

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

Number of subsets of {1..n} of which every subset has a different sum. A325864

a(n) = (1/n!)*A001565(n). A94792

a(n) = 10·n² + 10·n + 2. A273366

Number of unlabeled rooted trees with n vertices and more than two branches of the root. A331233

Triangle read by rows: T(n,k) = number of preferential arrangements of n things where the first object has rank k. A90665

a(1) = a(2) = 1. a(n) = a(n-1) + (largest nonprime {1 or composite} among the first n-2 terms of the sequence). A120760

Row sums of A163233 and A163235 divided by 3. A163478

Solution of the complementary equation a(n) = 2·a(n-1) - a(n-3) + b(n-1), where a(0) = 1, a(1) = 3, a(2) = 5, b(0) = 2, b(1) = 4, b(2) = 6, and (a(n)) and (b(n)) are increasing complementary sequences. A295614

Row sums of A376168. A376169

Triangle T(n,k) (n >= 1, 0<=k<=n) giving number of preferential arrangements of n things beginning with k (transposed, then read by rows). A54255