Properties of the Number 45321

Forty-Five Thousand Three Hundred Twenty-One

Basics

Value: 45320 → 45321 → 45322

Parity: odd

Prime: No

Previous Prime: 45319

Next Prime: 45329

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 15107

Divisors: 1, 3, 15107, 45321

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011000100001001

Octal: 130411

Duodecimal: 22289

Hexadecimal: b109

Square: 2053993041

Square Root: 212.88729412531882

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

Number of permutations of [n] avoiding the consecutive pattern 45321. A202213

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

Number T(n,k) of permutations of [n] with exactly k (possibly overlapping) occurrences of the consecutive pattern 45321; triangle T(n,k), n >= 0, 0 <= k <= max(0, floor((n-1)/4)), read by rows. A264781

a(n) = n! * ∑_k=0..n binomial(k+2,n-k) / k!. A377954

Numbers with 5 distinct digits {1,2,3,4,5} such that all adjacent digits (as well as first and last digits) are coprime. A104972

Number of ascent sequences of length n with the maximal number of descents. A241881

Number of permutations of [n] with exactly one occurrence of the consecutive pattern 45321. A264896

Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k doubledescents (0 <= k <= n-2). We say that i is a doubledescent (also called a double fall) of a permutation p if p(i) > p(i+1) > p(i+2). A162975

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 of [n] with exactly k (possibly overlapping) occurrences of the generalized pattern 23-1; triangle T(n,k), n>=0, 0<=k<=A125811(n)-1, read by rows. A260670