Properties of the Number -8946

Nine Hundred Forty-Six

Basics

Value: -8947 → -8946 → -8945

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ² × 7 × 71

Divisors: 1, 2, 3, 6, 7, 9, 14, 18, 21, 42

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -10001011110010

Octal: -21362

Duodecimal: -5216

Hexadecimal: -22f2

Square: 80030916

Square Root: 94.58329662260668

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) = ∑_d∣n (-1)^d-1*d³. A138503

Triangle read by rows, Bell transform of Bell numbers. A264428

Number of partitions of n in which the greatest part is 7. A26813

a(n) = ∑_{d >= 1, d divides n} (-1)^n-d*d³. A8457

Triangle read by rows: DR(n,d) is the number of properly d-dimensional polyominoes with n cells, modulo translations and rotations (n >= 1, 0 <= d <= n-1). A195738

Triangle T(n,k), read by rows, given by [0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, ...] δ [1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, ...] where δ is the operator defined in A084938. A89949

Array read by antidiagonals: T(n,k) = number of rooted 2-dimensional polyominoes with k cells, the cells being regular n-gons, with no symmetries removed. A94166

Number of different ways to select 7 disjoint subsets from {1..n} with equal element sum. A196234

Number of partitions of n into at most 7 parts. A8636

Triangle T(n,k) read by rows, arising in enumeration of catafusenes. A24462