Properties of the Number -29070

Twenty-Nine Thousand Seventy

Basics

Value: -29071 → -29070 → -29069

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ² × 5 × 17 × 19

Divisors: 1, 2, 3, 5, 6, 9, 10, 15, 17, 18

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -111000110001110

Octal: -70616

Duodecimal: -149A6

Hexadecimal: -718e

Square: 845064900

Square Root: 170.49926686059385

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

Series reversion of x + x² + x³ + x⁴ + x⁵. A217365

Triangle read by rows: T(n,m) = (m/(n-m))*∑_k=1..n-m((-1)^k*binomial(m-1,k-1)*binomial(3*(n-m)-k-1,n-m-k)), T(n,n)=1. A271460

a(n) = n*(n+1)*(n+2)*(n+3)/4. A33487

a(n) = 2·det(M(n; -1))/det(M(n; 0)), where M(n; m) is the n X n matrix with (i,j)-th element equal to 1/binomial(n + i + j + m, n). A7226

Integers that are Rhonda numbers to base 16. A100975

Number of integer partitions of n whose parts have choosable sets of integer partitions. A387328

a(n) = binomial(2·n, n) mod ((n+1)*(n+2)*(n+3)*(n+4)). A65346

Number of distinct perforation patterns for deriving (v,b) = (n+3,n) punctured convolutional codes from (2,1). A7224

Left edge of the triangle in A033291. A192735

Number of n X 3 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 1 and 0 1 1 vertically. A207363