Properties of the Number -10426

Ten Thousand Four Hundred Twenty-Six

Basics

Value: -10427 → -10426 → -10425

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 × 13 × 401

Divisors: 1, 2, 13, 26, 401, 802, 5213, 10426

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: -10100010111010

Octal: -24272

Duodecimal: -604A

Hexadecimal: -28ba

Square: 108701476

Square Root: 102.1077861869505

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

Expansion of (1-x)/(1+2·x-x²-x³). A78056

Second differences of partition numbers A000041. A53445

Vampire numbers: (definition 1): n has a nontrivial factorization using n's digits. A20342

Expansion of (1 + x)/(1 - 2·x - x² + x³). A33303

E.g.f. satisfies: A(x) = exp( x * (1 + A(x)³)/2 ). A349714

First of two sequences bisecting the second differences of the partition numbers (see A053445). A160644

Maximal term of TRIP-Stern sequence of level n corresponding to permutation triple (e,13,e). A271485

Numbers k such that A003961(k) = 2k +- 7, multiplied by the sign of difference A003961(k)-2k, where A003961 is fully multiplicative with a(prime(i)) = prime(i+1). A379237

Let M(n) be the n X n matrix m(i,j)=min(i,j) for 1<=i,j<=n then a(n) is the trace of M(n)^-6. A114358

Numbers with digit sum 13 that are multiples of 13. A283737