ℕ atory
Play Now

Properties of the Number -6663

Six Hundred Sixty-Three

Basics

Value: -6664 → -6663 → -6662

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 2221

Divisors: 1, 3, 2221, 6663

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1101000000111

Octal: -15007

Duodecimal: -3A33

Hexadecimal: -1a07

Square: 44395569

Square Root: 81.62720134857007

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

T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing x(i,j)+x(i-1,j) in the j direction. A250755
Beastly (or hateful) numbers: numbers containing the string 666 in their decimal expansion. A51003
Numbers in which 6 outnumbers all other digits together. A292736
T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the upper median minus the lower median of every 2X2 subblock equal. A236737
For a positive number k, let L(k) denote the list consisting of k followed by the prime factors of k, with repetition, in nondecreasing order; sequence gives composite k such that the digits of L(k) are in nonincreasing order. A372034
Number of undirected circular permutations i0, i1, ..., in of 0, 1, ..., n such that i0+i1, i1+i2, ...,in-1+in, in+i0 are among those k with 6·k-1 and 6·k+1 twin primes. A228917
T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2, 4, 5 or 6 king-move adjacent elements, with upper left element zero. A305642
Numbers n such that sum of divisors of these numbers gives a decimal repdigit. A96841
Numbers n with digits 3 and 6 only. A284633
Number of ways to partition the sum of all divisors of n (σ(n), A000203) into distinct positive integers not greater than n. A79125