Properties of the Number 53142

Fifty-Three Thousand One Hundred Forty-Two

Basics

Value: 53141 → 53142 → 53143

Parity: even

Prime: No

Previous Prime: 53129

Next Prime: 53147

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 × 3 × 17 × 521

Divisors: 1, 2, 3, 6, 17, 34, 51, 102, 521, 1042

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100111110010110

Octal: 147626

Duodecimal: 26906

Hexadecimal: cf96

Square: 2824072164

Square Root: 230.52548666036907

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

n written in fractional base 7/5. A24642

Fourth differences of A129983. A129988

q-Expansion of wedge character χ³(q). A288579

Row sums of A364891. A364892

a(n) is the string of integers S(n) concatenated together with no commas, where S(1)=1; for even n, S(n) is obtained from S(n-1) by inserting n after 1; and for odd n>1, S(n) = n,S(n-1). A171094

Hertzsprung's problem: ways to arrange n non-attacking kings on an n X n board, with 1 in each row and column. Also number of permutations of length n without rising or falling successions. A2464

a(n) = A053141(n)/2. A53142

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

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

Number of king permutations on n elements not beginning with the smallest element. A382644