Properties of the Number -10413

Ten Thousand Four Hundred Thirteen

Basics

Value: -10414 → -10413 → -10412

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 9

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 13 × 89

Divisors: 1, 3, 9, 13, 39, 89, 117, 267, 801, 1157

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: -10100010101101

Octal: -24255

Duodecimal: -6039

Hexadecimal: -28ad

Square: 108430569

Square Root: 102.04410811016969

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

Multiples of 13 containing a 13 in their decimal representation. A121033

16-gonal (or hexadecagonal) numbers: a(n) = n*(7·n-6). A51868

Coefficients of monic primitive irreducible polynomials over GF(5) listed in lexicographic order. A58950

T(n,k)=Number of 0..k arrays of length n with each element differing from at least one neighbor by 1 or less, starting with 0. A221683

Numbers k that can be expressed as k = w+x = y·z with w·x = (y+z)² where w, x, y, and z are all positive integers. A57369

G.f.: 1/(1 - x*(1-x⁵)/(1 - x²*(1-x⁶)/(1 - x³*(1-x⁷)/(1 - x⁴*(1-x⁸)/(1 - x⁵*(1-x⁹)/(1 - ...)))))), a continued fraction. A227374

At stage 1, start with a unit square. At each successive stage add 4*(n-1) new squares around outside with edge-to-edge contacts. Sequence gives number of squares (regardless of size) at n-th stage. A56640

3-Smith numbers. A104391

Start with a(0) = 0; then a(n) = smallest number > a(n-1) such that a(n) divides concat(a(n), a(n-1), ..., a(0)). A250746

a(n) = smallest k having at least three prime divisors d such that (d + n) | (k + n). A202158