Properties of the Number -9946

Nine Hundred Forty-Six

Basics

Value: -9947 → -9946 → -9945

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 2 × 4973

Divisors: 1, 2, 4973, 9946

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -10011011011010

Octal: -23332

Duodecimal: -590A

Hexadecimal: -26da

Square: 98922916

Square Root: 99.72963451251589

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

Semiprimes with semiprime digits (digits 4, 6, 9 only). A107342

Square array T(n,k), n >= 0, k >= 0, read by antidiagonals, where T(n,k) = (-1)ⁿ * ∑_j=0..n (-2)^j * binomial(n,j) * binomial(k·n+j+1,n)/(k·n+j+1). A336573

a(n) = n-1 for n <= 4, otherwise if n is even then a(n) = a(n-5)+2^n/2, and if n is odd then a(n) = a(n-1)+2^(n-3/2). A200310

Number of Sylvester classes of 5-packed words of degree n. A243668

Least k such that prime(n) is the smallest prime p for which k² + p² is also prime, or 0 if none. A263466

a(n) = ∑_k=0..n 3^k * binomial(n,k) * binomial(4·n+1,k). A388050

Third row of Pascal-(1,2,1) array A081577. A81583

Record-breaking values, for increasing positive integers k == 1 or 5 mod 6, of the conjectured length of the longest primitive cycle(s) of positive integers under iteration by the Collatz-like 3x+k function. A226670

a(n) = (-1)ⁿ * ∑_k=0..n (-2)^k * binomial(n,k) * binomial(n²+k+1,n)/(n²+k+1). A336495

Number of inequivalent (ordered) solutions to n² = sum of 8 squares of integers >= 0. A65462