Properties of the Number -1290556

Two Hundred Ninety Thousand Five Hundred Fifty-Six

Basics

Value: -1290557 → -1290556 → -1290555

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 2 ² × 19 × 16981

Divisors: 1, 2, 4, 19, 38, 76, 16981, 33962, 67924, 322639

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

9108 Try Today's Challenge

Representations

Binary: -100111011000100111100

Octal: -4730474

Duodecimal: -522A24

Hexadecimal: -13b13c

Square: 1665534789136

Square Root: 1136.0264081437545

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) is the number of distinct (infinite) output sequences from binary n-stage shift register which feeds back the complement of the last stage. A16

Number of nonisomorphic circulant tournaments, i.e., Cayley tournaments for cyclic group of order 2n-1. A49288

Number of circulant tournaments on 2n+1 nodes up to Cayley isomorphism. A2086

a(n) = ceiling(2^n-1/n). A53637

Number of subsets of {1,2,3,...,n} that sum to 0 mod 13. A68034

Number of frieze patterns of length n under a certain group (see Pisanski et al. for precise definition). A123046

Number of (n+3)X(1+3) 0..1 arrays with each row and column divisible by 13, read as a binary number with top and left being the most significant bits. A262482

a(n) = A000016(2·n). A300668

Number of binary vectors (x₁,...x_n-1) satisfying ∑_i=1..n-1 (-1)ⁱ*i·x_i = 0 (mod n). A114702