Properties of the Number 45213

Forty-Five Thousand Two Hundred Thirteen

Basics

Value: 45212 → 45213 → 45214

Parity: odd

Prime: No

Previous Prime: 45197

Next Prime: 45233

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 7 × 2153

Divisors: 1, 3, 7, 21, 2153, 6459, 15071, 45213

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011000010011101

Octal: 130235

Duodecimal: 221B9

Hexadecimal: b09d

Square: 2044215369

Square Root: 212.63348748492086

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 integer compositions of n whose leaders of anti-runs are weakly decreasing. A374682

Decimal encoding T(n,k) of the k-th non-averaging permutation of [n]; triangle T(n,k), n >= 0, k = 1..A003407(n), read by rows. A292523

Expansion of ∏_k>=1 1/(1 - x^k)^sigma₁(k-k), where sigma₁(k) = sum of divisors of k (A000203). A318784

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

Permutations in S_n avoiding the patterns {4321, 34512, 45123, 35412, 43512, 45132, 45213, 53412, 45312, 45231}. A191721

Number of permutations avoiding the consecutive pattern 45213. A202223

Number of permutations avoiding the patterns {4231, 4321, 35142, 45312, 42513, 45132, 35412, 45213, 43512, 456123, 351624, 451623, 356124}; number of strong sorting class based on 4231. A111280

Number of permutations avoiding the patterns {4321, 45132, 45231, 35412, 53412, 45213, 43512, 45312, 456123, 451623, 356124}; number of strong sorting class based on 4321. A111283

Number of permutations of 1..n containing the relative rank sequence { 23145 } at any spacing. A158423

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