Properties of the Number -7070

Seventy

Basics

Value: -7071 → -7070 → -7069

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 × 5 × 7 × 101

Divisors: 1, 2, 5, 7, 10, 14, 35, 70, 101, 202

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -1101110011110

Octal: -15636

Duodecimal: -4112

Hexadecimal: -1b9e

Square: 49984900

Square Root: 84.08329203831163

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

Expansion of (∏_j>=1 (1-(-x)^j) - 1)¹⁰ in powers of x. A1488

a(n) = n*(n+1)*(5·n+1)/6. A33994

Number of partitions of n containing a clique of size 6. A183563

Number of n-node ordered rooted trees of height equal to the number of internal (non-leaf) nodes. A358588

T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2 or 4 horizontally or antidiagonally adjacent elements, with upper left element zero. A302069

Numbers whose set of base 10 digits is {0,7}. A204094

T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the permanents of all 2X2 subblocks equal and nonzero. A204840

Number of compositions (ordered partitions) of n into distinct parts, the least being 1. A339162

Number of partitions of 2n into distinct parts < n. A231429

Number of ways to partition n into distinct positive integers <= φ(n), where φ is Euler's totient function (A000010). A79124