Properties of the Number 35054

Thirty-Five Thousand Fifty-Four

Basics

Value: 35053 → 35054 → 35055

Parity: even

Prime: No

Previous Prime: 35053

Next Prime: 35059

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 × 17 × 1031

Divisors: 1, 2, 17, 34, 1031, 2062, 17527, 35054

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000100011101110

Octal: 104356

Duodecimal: 18352

Hexadecimal: 88ee

Square: 1228782916

Square Root: 187.22713478553263

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 n such that n²⁰⁴⁸ + 1 is prime (a generalized Fermat prime). A88361

a(n) = n! * [xⁿ] exp(exp(x)*(exp(n·x) - 1)/(exp(x) - 1) - n). A320288

Square array T(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of e.g.f. exp(∑_j=1..k (exp(j·x) - 1)). A355423

Number of (n+2) X 5 binary arrays avoiding patterns 001 and 110 in rows, columns and nw-to-se diagonals. A202442

Number of nX3 0..1 arrays with each 1 adjacent to 0, 3 or 5 king-move neighboring 1s. A296829

Expansion of e.g.f. exp(∑_k=1..4 (exp(k·x) - 1)). A355422

Number of length n 1..(5+2) arrays with no leading or trailing partial sum equal to a prime and no consecutive values equal. A254215

T(n,k) = number of length n 1..(k+2) arrays with no leading or trailing partial sum equal to a prime and no consecutive values equal. A254218

T(n,k)=Number of nXk 0..1 arrays with each 1 adjacent to 0, 3 or 5 king-move neighboring 1s. A296834

Number of forests of identical trees. A35054