Properties of the Number 35213

Thirty-Five Thousand Two Hundred Thirteen

Basics

Value: 35212 → 35213 → 35214

Parity: odd

Prime: No

Previous Prime: 35201

Next Prime: 35221

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 23 × 1531

Divisors: 1, 23, 1531, 35213

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000100110001101

Octal: 104615

Duodecimal: 18465

Hexadecimal: 898d

Square: 1239955369

Square Root: 187.65127231116767

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 (1,0) steps in all peakless Motzkin paths of length n (can be easily translated into RNA secondary structure terminology). A110236

a(n) = ∑_{k=floor(n/4)..R} C(k, m·k - (-1)ⁿ*(R - k)) * C(k + 1, m*(k + 2) - (-1)ⁿ*(R - k + 1)) where m = (n + 1) mod 2 and R = (n + m - 3)/2 for n > 0 and a(0) = 1. A202411

Denominators of continued fraction convergents to sqrt(391). A41743

Triangle read by rows: T(n,k) is the number of Motzkin paths of length n with k peaks (n>=0, 0<=k<=floor(n/2)). A97860

Irregular array read by rows, where n-th row gives denominators of the Egyptian fraction expansion, derived using the greedy algorithm, for the absolute value of the fractional part of the (2n)th Bernoulli number. A136375

Composite numbers n such that the distinct digits in n and the distinct digits in the proper divisors of n are the same. A237713

Number of nX7 integer arrays with each element equal to the number of horizontal and antidiagonal neighbors not equal to itself. A265990

Numbers k such that the set of all the decimal digits of k is the same as the set of all the decimal digits of the proper divisors of k. A282755

a(n) = hypergeom([-n, 1 + n, 2 + n, -1 - n], [1/2, 1/2, 1], 1/16). Row sums of A370233. A370234

Coefficients in expansion of Dirichlet series Product_p (1-(Kronecker(m,p)+1)*p^-s+Kronecker(m,p)*p^-2s)^-1 for m = 31. A35213