Properties of the Number 35696

Thirty-Five Thousand Six Hundred Ninety-Six

Basics

Value: 35695 → 35696 → 35697

Parity: even

Prime: No

Previous Prime: 35677

Next Prime: 35729

Digit Sum: 29

Digital Root: 2

Palindrome: No

Factorization: 2 ⁴ × 23 × 97

Divisors: 1, 2, 4, 8, 16, 23, 46, 92, 97, 184

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000101101110000

Octal: 105560

Duodecimal: 187A8

Hexadecimal: 8b70

Square: 1274204416

Square Root: 188.9338508579127

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 self-inverse permutations on n letters, also known as involutions; number of standard Young tableaux with n cells. A85

Table T(n,k) giving number of permutations of [1..n] with order dividing k, read by antidiagonals. A8307

T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with no element unequal to a strict majority of its horizontal, diagonal and antidiagonal neighbors, with values 0..2 introduced in row major order. A231396

Number T(n,k) of sets of exactly k 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; triangle T(n,k), n>=0, read by rows. A293815

Number T(n,k) of multisets of exactly k 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; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A293808

Sum of squares of first n positive integers congruent to 1 mod 3. A24215

T(n,k)=Number of (n·k)Xk binary arrays with nonzero rows in decreasing order, no more than 2 ones in any row and exactly n ones in every column. A188448

Number of standard Young tableaux of n cells and height <= 11. A229053

Number T(n,k) of partitions of [n] having exactly k blocks of size at least three; triangle T(n,k), n>=0, 0<=k<=floor(n/3), read by rows. A355144

Triangular array read by rows: T(m,n) = number of Yamanouchi words of length m that start with n, m >= 1, n = 1..m. A369588