Properties of the Number -3415

Four Hundred Fifteen

Basics

Value: -3416 → -3415 → -3414

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 5 × 683

Divisors: 1, 5, 683, 3415

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -110101010111

Octal: -6527

Duodecimal: -1B87

Hexadecimal: -d57

Square: 11662225

Square Root: 58.43800133474792

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

First differences of number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 161", based on the 5-celled von Neumann neighborhood. A270453

First differences of number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 433", based on the 5-celled von Neumann neighborhood. A272148

Expansion of 1 / (1 + ∑_{p prime, k>=1} x^{p^k}). A329098

Coordination sequence for 3D uniform tiling formed by stacking parallel layers of the 3.12.12 2D tiling (cf. A250122). A299257

Triangle read by rows: row n is the first row of the matrix M[n]^n-1, where M[n] is the n X n tridiagonal matrix with main diagonal (3,4,4,...) and super- and subdiagonals (1,1,1,...). A124574

Numbers k such that 2^k - k is prime. A48744

a(n) = ∑_k=1..n k*φ(k). A11755

Number of non-strict integer partitions of n that are constant or whose part multiplicities, except possibly the first and last, are all even. A349795

Triangle T, read by rows, such that column 2k+1 of T equals column k of T² and column 2k of T equals column k of T·R: [T²](n+k,k) = T(n+2k+1,2k+1) and [T·R](n+k,k) = T(n+2k,2k) for n>=0, k>=0, where R = SHIFT_RIGHT(T). A117418

a(n) is the smallest nonnegative integer such that a(n)! contains a string of exactly n consecutive 6's. A254501