Properties of the Number 54231

Fifty-Four Thousand Two Hundred Thirty-One

Basics

Value: 54230 → 54231 → 54232

Parity: odd

Prime: No

Previous Prime: 54217

Next Prime: 54251

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 18077

Divisors: 1, 3, 18077, 54231

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1101001111010111

Octal: 151727

Duodecimal: 27473

Hexadecimal: d3d7

Square: 2941001361

Square Root: 232.87550322006823

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

Fixed points of the function A260529(n) = concatenation of the positions of digits 9, 8,..., 0 in the decimal representation of n, using 1 for the rightmost digit etc., skipping digits which don't occur. A260275

a(n) = ∑_k=0..n binomial(n,k) * binomial(n+2·k,n-k). A378403

Number of permutations in S_n avoiding {bar 5}{bar 4}231 (i.e., every occurrence of 231 is contained in an occurrence of a 54231). A137553

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

Number of permutations σ of [n] without fixed points such that σ⁶ = Id. A261317

Number T(n,k) of permutations p of [n] such that in 0p the sum of all jumps equals k + n; triangle T(n,k), n >= 0, 0 <= k <= n*(n-1)/2, read by rows. A291722

Number T(n,k) of permutations of [n] with exactly k (possibly overlapping) occurrences of some of the consecutive step patterns UUD, UDU, DUU (U=up, D=down); triangle T(n,k), n>=0, 0<=k<=max(0,n-3), read by rows. A231384

Number of permutations p of [n] such that |p(i) - p(i-1)| <= 2 and |p(i) - p(i-2)| <= 3. A333833

Number of permutations of [n] avoiding ascents from odd to even numbers. A231601