Properties of the Number -2413

Four Hundred Thirteen

Basics

Value: -2414 → -2413 → -2412

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 10

Digital Root: 1

Palindrome: No

Factorization: 19 × 127

Divisors: 1, 19, 127, 2413

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: -100101101101

Octal: -4555

Duodecimal: -1491

Hexadecimal: -96d

Square: 5822569

Square Root: 49.122296363260546

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

L.g.f.: log( ∑_n>=0 x^n² ), the log of the characteristic function of the squares. A162552

Alternating sum of 9-gonal (or nonagonal) numbers. A266086

Decimal representation of permutations of lengths 1, 2, 3, ... arranged lexicographically. A30299

Number of integer partitions of n with unimodal run-lengths. A332280

Integers of the form m*(m + 6)/7. A274978

Number of subset-sums of strict integer partitions of n. A365925

Triangle T(n, k, m) = (m*(n-k) + 1)*T(n-1, k-1, m) + (m·k + 1)*T(n-1, k, m) + m·f(n,k)*T(n-2, k-1, m) with T(n, 0, m) = T(n, n, m) = 1, f(n, k) = 2^k if k <= floor(n/2) otherwise 2^n-k, and m = 1, read by rows. A157268

Triangle T(n, k, m) = (m*(n-k) + 1)*T(n-1, k-1, m) + (m·k + 1)*T(n-1, k, m) + m·f(n,k)*T(n-2, k-1, m) with T(n, 0, m) = T(n, n, m) = 1, f(n, k) = 2·k if k <= floor(n/2) otherwise 2*(n-k), and m = 1, read by rows. A157275

a(n) = 2·n² + 3·n - 1. A91823

Number of "ON" cells at n-th stage in simple 2-dimensional cellular automaton (same as A160410, but a(1) = 1, not 4). A160414