Properties of the Number 52526

Fifty-Two Thousand Five Hundred Twenty-Six

Basics

Value: 52525 → 52526 → 52527

Parity: even

Prime: No

Previous Prime: 52517

Next Prime: 52529

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 × 26263

Divisors: 1, 2, 26263, 52526

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100110100101110

Octal: 146456

Duodecimal: 26492

Hexadecimal: cd2e

Square: 2758980676

Square Root: 229.18551437645442

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

G.f.: exp( ∑_n>=1 2^A090740(n) * xⁿ/n ) where A090740(n) = highest exponent of 2 in 3ⁿ-1. A182000

Triangle read by rows: T(n,k) is the number of weighted lattice paths in B(n) having k valleys. The members of B(n) are paths of weight n that start at (0,0), end on but never go below the horizontal axis, and whose steps are of the following four kinds: an (1,0)-step with weight 1, an (1,0)-step with weight 2, a (1,1)-step with weight 2, and a (1,-1)-step with weight 1. The weight of a path is the sum of the weights of its steps. A valley is a (1,-1)-step followed by a (1,1)-step. A182900

a(n) = 6+32·n²+8·n*(7+8·n²)/3. A167498

Number of weighted lattice paths in B(n) having no valleys. The members of B(n) are paths of weight n that start at (0,0), end on but never go below the horizontal axis, and whose steps are of the following four kinds: an (1,0)-step with weight 1, an (1,0)-step with weight 2, a (1,1)-step with weight 2, and a (1,-1)-step with weight 1. The weight of a path is the sum of the weights of its steps. A valley is a (1,-1)-step followed by a (1,1)-step. A182901

Numbers n such that the n-th digit (after the decimal point) in the decimal expansion of π are the occurrence of the least significant digit represented by the more significant digits. A201545

Number of (n+2)X(2+2) 0..3 arrays with every 3X3 subblock row and column sum not 1 3 6 or 8 and every diagonal and antidiagonal sum 1 3 6 or 8. A252047

Poincaré series [or Poincare series] P(C_5,2; x). A124613

T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum not 1 3 6 or 8 and every diagonal and antidiagonal sum 1 3 6 or 8. A252053

Number of labeled rooted trees with n leaves in which the degrees of the root and all internal nodes are >= 3. A52526