Properties of the Number -40670

Forty Thousand Six Hundred Seventy

Basics

Value: -40671 → -40670 → -40669

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 × 5 × 7 ² × 83

Divisors: 1, 2, 5, 7, 10, 14, 35, 49, 70, 83

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

9108 Try Today's Challenge

Representations

Binary: -1001111011011110

Octal: -117336

Duodecimal: -1B652

Hexadecimal: -9ede

Square: 1654048900

Square Root: 201.66804407243106

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

Row sums of irregular triangle A070168. A285098

Expansion of the series e(q)*e(-q) (even coefficients only), where the series e(q) is Morier-Genoud and Ovsienko's q-analog of the real number e = exp(1). A392022

Number of (n+1) X (7+1) 0..1 arrays with each 2 X 2 subblock having clockwise pattern 0000 0011 or 0101. A259221

Triangle read by rows: T(n,k) is the number of paths of length n in the first quadrant, starting at the origin, ending at height k and consisting of 2 kind of upsteps U=(1,1) (U1 and U2), 3 kind of flatsteps F=(1,0) (F1, F2 and F3) and 1 kind of downsteps D=(1,-1). A134426

a(n) = ( (5 + 2·sqrt(2))ⁿ - (5 - 2·sqrt(2))ⁿ )/(4·sqrt(2)). A154340

Generating primitive Pythagorean triangles by using (n, n+1) gives perimeters for each n. This sequence lists the sum of these perimeters for each n triangles. A193068