Properties of the Number 35621

Thirty-Five Thousand Six Hundred Twenty-One

Basics

Value: 35620 → 35621 → 35622

Parity: odd

Prime: No

Previous Prime: 35617

Next Prime: 35671

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 179 × 199

Divisors: 1, 179, 199, 35621

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000101100100101

Octal: 105445

Duodecimal: 18745

Hexadecimal: 8b25

Square: 1268855641

Square Root: 188.73526432545668

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 permutations of [n] having no adjacent transpositions, that is, no cycles of the form (i, i+1). A177249

Triangle read by rows: T(n,k) is the number of permutations of [n] having k adjacent transpositions (0 <= k <= floor(n/2)). An adjacent transposition is a cycle of the form (i, i+1). A177248

∑_k<=n (σ(k)²), where σ(k) denotes the sum of the divisors of k A000203. A72379

a(n) = numerator(6 * ∑_k=2..n 1/(binomial(2·k, k)*(k-1))). A145566

Number of symmetrically unique Dyck paths of semilength n and height three. A291887

Brilliant numbers k such that 2k+1 is also brilliant. A85649

n-th 6k+1 prime times n-th 6k-1 prime. A48629

Number of increasing interval-labeled restricted ternary trees on the label set {0,1,...,n}. A390399

Number of partitions of n into parts 4k and 4k+1 with at least one part of each type. A35621

Denominators of partial sums of a certain series of inverse central binomial coefficients. A145567