Properties of the Number -40210

Forty Thousand Two Hundred Ten

Basics

Value: -40211 → -40210 → -40209

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 7

Digital Root: 7

Palindrome: No

Factorization: 2 × 5 × 4021

Divisors: 1, 2, 5, 10, 4021, 8042, 20105, 40210

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1001110100010010

Octal: -116422

Duodecimal: -1B32A

Hexadecimal: -9d12

Square: 1616844100

Square Root: 200.5243127403757

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 k such that k | 7^k + 1. A15954

6th power analog of Keith numbers. A281917

Numbers k such that k mod (2, 3, 4, ... , i+1) = (d_i, d_i-1, ..., d₁), where d₁, d₂, ..., d_i are the digits of k, with MSD(k) = d₁ and LSD(k) = d_i. A319599

Number of -n..n arrays x(0..3) of 4 elements with zero sum and elements alternately strictly increasing and strictly decreasing. A200058

Convolutory inverse of the Thue Morse sequence. A225132

Number of nX6 0..1 arrays with every element unequal to 0, 2 or 3 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero. A317813

A triangle sequence made symmetrical by reverse coefficients: t0(n,m)=(2 + n! - m! - (n - m)! + 2 + PartitionsP[n] - PartitionsP[ m] - PartitionsP[n - m]); t(n,m)=(t0(n,m)+Reverse[t0(n,m)])/2. A156046

G.f. A(x) satisfies: 1 = ∑_n>=0 ((1+x)^2·n-1 - A(x))ⁿ. A325154