Properties of the Number 35644

Thirty-Five Thousand Six Hundred Forty-Four

Basics

Value: 35643 → 35644 → 35645

Parity: even

Prime: No

Previous Prime: 35617

Next Prime: 35671

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 ² × 7 × 19 × 67

Divisors: 1, 2, 4, 7, 14, 19, 28, 38, 67, 76

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 1000101100111100

Octal: 105474

Duodecimal: 18764

Hexadecimal: 8b3c

Square: 1270494736

Square Root: 188.79618640216228

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

Numbers m such that 2*φ(m) = φ(m+1). A50472

Sum of the parts in the partitions of 4n into 4 parts with smallest part = 1. A239056

Smallest k such that both k-n and k+n are primes and there are no primes between them. A87378

a(n) is the smallest number m, such that m+n is the next prime and m-n is the previous prime. A282690

Triangle read by rows: T(n,k) is the number of compositions of n having degree of asymmetry equal to k (n>=0; 0<=k<=n/3). A275433

G.f. A(x,y) satisfies: ∑_n=-oo...+oo (xⁿ + y)ⁿ = exp( (1-y) * A(x,y) ) / (1-y), where A(x,y) = ∑_n>=1 xⁿ/n·Sum{k=0..n-1} T(n,k)*y^k, written here as a flattened triangle of coefficients T(n,k) read by rows. A321600

<h[d+1,d-1],s[d,d]*s[d,d]*s[d,d]> where h[d+1,d-1] is a homogeneous symmetric function, s[d,d] is a Schur function indexed by two parts, * represents the Kronecker product and <, > is the standard scalar product on symmetric functions. A115376

Number of multisets of exactly five nonempty words with a total of n letters over n-ary alphabet such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter. A294007

Number of -1..1 arrays x(i) of n+1 elements i=1..n+1 with x(i)+x(j), x(i+1)+x(j+1), -(x(i)+x(j+1)), and -(x(i+1)+x(j)) having two or three distinct values for every i<=n and j<=n. A211477

G.f. satisfies: A(x) = (1+x·A(x))*(1+x²*A(x))*(1+x³*A(x)). A182053