Properties of the Number -43810

Forty-Three Thousand Eight Hundred Ten

Basics

Value: -43811 → -43810 → -43809

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 × 5 × 13 × 337

Divisors: 1, 2, 5, 10, 13, 26, 65, 130, 337, 674

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

9108 Try Today's Challenge

Representations

Binary: -1010101100100010

Octal: -125442

Duodecimal: -2142A

Hexadecimal: -ab22

Square: 1919316100

Square Root: 209.3083849252103

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

a(0) = 1, a(n) = 32·n² + 2 for n > 0. A10021

Signed recurrence over enriched r-trees: a(n) = (-1)ⁿ + Sum_y ∏_{i in y} a(y) where the sum is over all integer partitions of n - 1. A301470

Triangle, read by rows, T(n, k) = binomial(n, k) for n < 2 and binomial(n, k) + 3^n-1*binomial(n-2, k -1) otherwise. A146987

Partial sums of A081660. A81661

Number of 2 X n arrays of the minimum value of corresponding elements and their horizontal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..3 2 X n array. A219715

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (-1, 0, 1), (0, 1, 1), (1, -1, 0), (1, 0, -1)}. A149060

Smallest number k such that A345112(k) = n. A357361