Properties of the Number -10704

Ten Thousand Seven Hundred Four

Basics

Value: -10705 → -10704 → -10703

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 2 ⁴ × 3 × 223

Divisors: 1, 2, 3, 4, 6, 8, 12, 16, 24, 48

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -10100111010000

Octal: -24720

Duodecimal: -6240

Hexadecimal: -29d0

Square: 114575616

Square Root: 103.4601372510205

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.: exp( ∑_n>=1 xⁿ * (1+x)ⁿ / (n*(1-xⁿ)) ). A227681

a(n) = |{m : multiplicative order of 9 mod m = n}|. A59891

Numbers that have 9 terms in their Zeckendorf representation. A179249

Number of integer partitions of n > 0 where the maximum part minus the minimum part equals the length minus the number of distinct parts. A324516

T(n,k) = 1/4 the number of (n+1) X (k+1) binary arrays with equal numbers of 2 X 2 subblocks with sums 1 and 3. A184604

T(n,k) = number of (n+1)X(k+1) 0..3 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. A250544

T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum 2 4 5 or 7 and every diagonal and antidiagonal sum not 2 4 5 or 7. A251923

Array read by descending antidiagonals: T(n,k) is the number of chiral pairs of colorings of the edges of a regular n-dimensional orthotope (hypercube) using k or fewer colors. A337409

Array read by descending antidiagonals: T(n,k) is the number of chiral pairs of colorings of the edges of a regular n-dimensional orthoplex (cross polytope) using k or fewer colors. A337413

The PDO(n) function (Partitions with Designated summands in which all parts are Odd): the sum of products of multiplicities of parts in all partitions of n into odd parts. A102186