Properties of the Number -3241

Two Hundred Forty-One

Basics

Value: -3242 → -3241 → -3240

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 10

Digital Root: 1

Palindrome: No

Factorization: 7 × 463

Divisors: 1, 7, 463, 3241

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -110010101001

Octal: -6251

Duodecimal: -1A61

Hexadecimal: -ca9

Square: 10504081

Square Root: 56.929781309961136

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

Expansion of g.f. A(x,y) satisfying ∑_n>=0 ∏_k=1..n (x^k + y·A(x,y)) = 1 + (y+1) * ∑_n>=1 x^n*(n+1/2), as a triangle of coefficients T(n,k) of xⁿ*y^k in A(x,y) read by rows. A370140

Coefficients of modular function G₃(τ). A5761

Alternating row sums of array A078741 ((3,3)-Stirling2). A90212

a(n) = 1 + n + 2·n². A84849

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

Preperiod (or threshold) of orbit of Post's {00, 1101} tag system applied to the word (100)ⁿ, or -1 if this word has an unbounded trajectory. A284119

a(0) = 0, a(1) = 1; a(n) = max { 4·a(k) + a(n-k) | 1 <= k <= n/2 }, for n > 1. A116520

Number of primes < prime(n)². A879

Number of integer partitions of n with no part divisible by all the others. A343341

Number of "ON" cells at n-th stage in simple 2-dimensional cellular automaton (see Comments for precise definition). A160118