Properties of the Number -3414

Four Hundred Fourteen

Basics

Value: -3415 → -3414 → -3413

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 569

Divisors: 1, 2, 3, 6, 569, 1138, 1707, 3414

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -110101010110

Octal: -6526

Duodecimal: -1B86

Hexadecimal: -d56

Square: 11655396

Square Root: 58.42944463196617

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

a(n) = 2·a(n-1) - 3·a(n-2) + 2·a(n-3) with a(0) = 1, a(1) = 5, a(2) = 6. A105577

Expansion of e.g.f: sech(arcsinh(x)+tan(x)). A13102

T(n,m) = number of 0..m-1 integer arrays v[1..n] of length n with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..n-1. A171307

Inverse binomial transform of a math magic problem. A84214

a(n) = 1 + ∑_j=1..n j^j. A62970

T(n,k)=Number of length n+3 0..k arrays with no four consecutive terms having the maximum of any two terms equal to the minimum of the remaining two terms. A250387

Non-palindromic balanced numbers (in base 10). A256075

Positive numbers whose product of digits is four times their sum. A62036

T(n,k)=Number of 0..k arrays x(0..n-1) of n elements with each no smaller than the sum of its three previous neighbors modulo (k+1). A200668

G.f.: exp( ∑_n>=1 A000204(n)³ * xⁿ/n ) where A000204 is the Lucas numbers. A203803