Properties of the Number -70980

Seventy Thousand Nine Hundred Eighty

Basics

Value: -70981 → -70980 → -70979

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 2 ² × 3 × 5 × 7 × 13 ²

Divisors: 1, 2, 3, 4, 5, 6, 7, 10, 12, 13

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

9108 Try Today's Challenge

Representations

Binary: -10001010101000100

Octal: -212504

Duodecimal: -350B0

Hexadecimal: -11544

Square: 5038160400

Square Root: 266.4207199149496

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

Numbers j such that j and 2j are both between a pair of twin primes. A66388

Row sums of triangle A303990. A303991

Numbers m such that exactly four subsets of {m-1, m, m+1} sum up to a prime number. A221310

Values of k such that k² + (k+3)² is a square. A241976

Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = ∑_j=0..n k^j * j^k. A368486

Triangle read by rows: T(n,k) is the number of noncrossing connected graphs on n nodes on a circle, having exactly k four-sided faces, n>=2, 0<=k<=floor(n/2)-1. A94046

Period of the decimal representation of 1/Fibonacci(n). A175561

Number of (n+2) X (4+2) 0..1 arrays with each 3 X 3 subblock having clockwise perimeter pattern 00010001 00010101 or 01010101. A261109

Integer areas of integer-sided triangles such that the length of two sides are Fibonacci numbers. A236539

Triangle T(n,k) (1 <= k <= n) read by rows: T(n,k) = c_n * F(k)/F(k+2) where c_n = LCM of F(3), F(4), ... F(n+2) (and F() are the Fibonacci numbers). A374667