Properties of the Number -10438

Ten Thousand Four Hundred Thirty-Eight

Basics

Value: -10439 → -10438 → -10437

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 × 17 × 307

Divisors: 1, 2, 17, 34, 307, 614, 5219, 10438

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -10100011000110

Octal: -24306

Duodecimal: -605A

Hexadecimal: -28c6

Square: 108951844

Square Root: 102.1665307231287

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

Number of partitions of n if there are two kinds of 1, two kinds of 2 and two kinds of 3. A98

a(n) = (2·5ⁿ + 2ⁿ)/3. A82685

T(n,k) = Number of n X k nonnegative integer arrays with each row and column an ascent sequence (interior element no greater than one plus up-steps preceding it). A202549

T(n,k)=Number of nXk 0..2 arrays with new values introduced in each row and column in sequential order starting with zero. A268056

T(n,k)=Number of nXk nonnegative integer arrays with new values introduced in each row and column in sequential order starting with zero. A268079

Number of partitions of n into Lucas parts (A000032). A67593

a(n) = 9·n² + n. A154517

Number of "nonlinear" trees on n nodes. A316321

Numbers k such that d(k) + d(k+1) + d(k+2) = 8, where d(k) = A001223. A64026

a(n) = ∑_{k = 0..floor(n/2)} floor(C(n-k,k)/(k+1)). A95719