Properties of the Number 35052

Thirty-Five Thousand Fifty-Two

Basics

Value: 35051 → 35052 → 35053

Parity: even

Prime: No

Previous Prime: 35051

Next Prime: 35053

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 ² × 3 × 23 × 127

Divisors: 1, 2, 3, 4, 6, 12, 23, 46, 69, 92

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000100011101100

Octal: 104354

Duodecimal: 18350

Hexadecimal: 88ec

Square: 1228642704

Square Root: 187.2217936032021

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

T(n,k)=Number of nXk 0..2 arrays x(i,j) with each element horizontally, diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 3, and upper left element zero. A230469

G.f.: A(x,y) = exp( ∑_n>=1 [∑_k=0..n C(n,k)⁴*y^k] * xⁿ/n ) = ∑_n>=0,k=0..n T(n,k)*xⁿ*y^k, as a triangle of coefficients T(n,k) read by rows. A181144

Irregular triangle T(n,k) (n >= 0, k >= 2) read by rows. Consider the planar graph formed from an equilateral triangle with n equally spaced points placed on each edge, as discussed in A092867(n+1). Then T(n,k) is the number of interior points where exactly k chords cross. A366479

Numbers k such that σ(σ(σ(k))) == 6*σ(k). A67065

Central coefficients of triangle A181144. A218140

Number of n X 5 0..2 arrays x(i,j) with each element horizontally, diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 3, and upper left element zero. A230466

Number of 3Xn 0..2 arrays x(i,j) with each element horizontally, diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 3, and upper left element zero. A230471

Number of sets of rooted connected graphs where every block is a complete graph. A35052

Triangle, read by rows, T(n, k) = ∑_j=0..k (n+k)!/((n-j)!*(k-j)!*j!) + ∑_j=0..n-k (2·n-k)!/((n-j)!*(n-k-j)!*j!). A176081