Properties of the Number -43838

Forty-Three Thousand Eight Hundred Thirty-Eight

Basics

Value: -43839 → -43838 → -43837

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 2 × 23 × 953

Divisors: 1, 2, 23, 46, 953, 1906, 21919, 43838

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8109 Try Today's Challenge

Representations

Binary: -1010101100111110

Octal: -125476

Duodecimal: -21452

Hexadecimal: -ab3e

Square: 1921770244

Square Root: 209.37526119386692

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

T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with no 3x3 subblock diagonal sum 2 and no antidiagonal sum 2 and no row sum 0 and no column sum 0. A255792

Partial sums of usigma(n)²: square of the sum of unitary divisors of n. A74789

a(n) = ∑_k=n+1..2·n T(n,k), T given by A027052. A27077

a(n) is the smallest natural number we cannot obtain from n, n+1, n+2, n+3, n+4, n+5, n+6, n+7 and the operators +, -, *, /, using each number only once. A143192

Number of (n+2)X(n+2) 0..1 arrays with no 3x3 subblock diagonal sum 2 and no antidiagonal sum 2 and no row sum 0 and no column sum 0. A255784

Number of (n+2) X (5+2) 0..1 arrays with no 3 X 3 subblock diagonal sum 2 and no antidiagonal sum 2 and no row sum 0 and no column sum 0. A255789