Properties of the Number 53241

Fifty-Three Thousand Two Hundred Forty-One

Basics

Value: 53240 → 53241 → 53242

Parity: odd

Prime: No

Previous Prime: 53239

Next Prime: 53267

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 17747

Divisors: 1, 3, 17747, 53241

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100111111111001

Octal: 147771

Duodecimal: 26989

Hexadecimal: cff9

Square: 2834604081

Square Root: 230.7401135476881

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

Numbers m such that the sum of the first k odd primes = m-th odd prime. A179321

Number of permutations avoiding the consecutive pattern 53241. A202220

Distinct-digit numbers that are the concatenation of m and prime(m) for some number m. A255729

Number of permutations in S_n that avoid the pattern 53241. A256202

2^n-1 times coefficient of·in (1+x)ⁿ mod U(n,x), U the Chebyshev polynomials. A99590

Number T(n,k) of defective (binary) heaps on n elements where k ancestor-successor pairs do not have the correct order; triangle T(n,k), n >= 0, 0 <= k <= A061168(n), read by rows. A306393

Central binomial coefficient - 1. A14495

Number T(n,k) of permutations p of [n] such that in 0p the largest up-jump equals k and no down-jump is larger than 2; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A291680

Eulerian numbers (Euler's triangle: column k=4 of A008292, column k=3 of A173018). A498

Expansion of (1-x)*(1+x)/(1-2·x-x²+x³). A52534