Properties of the Number -3341

Three Hundred Forty-One

Basics

Value: -3342 → -3341 → -3340

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 13 × 257

Divisors: 1, 13, 257, 3341

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -110100001101

Octal: -6415

Duodecimal: -1B25

Hexadecimal: -d0d

Square: 11162281

Square Root: 57.8013840664737

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) = ∑_i=1..n (-1)ⁱ⁺¹ prime(i)², where prime(k) denotes the k-th prime: alternating sum of the squares of the first n primes. A240860

Partial sums of A299259. A299265

Monotonic ordering of set S generated by these rules: if·and y are in S then x² + y² is in S, and 1 is in S. A192476

Numbers that are the sum of 12 positive 7th powers. A3379

Number of integer partitions of n whose distinct parts are pairwise coprime. A304709

Indices k such that A020509(k)=φ[k](-10) is prime, where φ is a cyclotomic polynomial. A138920

T(n,k)=Number of length n+4 0..k arrays with every five consecutive terms having the maximum of some two terms equal to the minimum of the remaining three terms. A254698

Triangle read by rows: T(n,k) is the number of unlabeled acyclic digraphs with n >= 0 nodes and n-k outnodes (0 <= k <= n). A122078

T(n, k) = S(2n, n, k) for 0<=k<=n and n>=0, where S(p, q, r) is the number of upright paths from (0, 0) to (p, p-q) that do not rise above the line y = x-r. A50157

Numbers k such that numerator of Bernoulli(2·k) is divisible by 257, the tenth irregular prime. A92229