ℕ atory
Play Now

Properties of the Number 53656

Fifty-Three Thousand Six Hundred Fifty-Six

Basics

Value: 53655 → 53656 → 53657

Parity: even

Prime: No

Previous Prime: 53653

Next Prime: 53657

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 3 × 19 × 353

Divisors: 1, 2, 4, 8, 19, 38, 76, 152, 353, 706

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1101000110011000

Octal: 150630

Duodecimal: 27074

Hexadecimal: d198

Square: 2878966336

Square Root: 231.63764806265843

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 4-step self-avoiding walks on an n X n square summed over all starting positions. A188149
Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite NON = Nonasil-[ 4158 ] [Si88O176].4R starting with a T3 atom. A19213
Number of cyclic graphs with oriented edges on n nodes (up to symmetry of dihedral group). A53656
Number of unordered triples of self-avoiding paths with nodes that cover all vertices of a convex n-gon. A359404
Number of unordered pairs of self-avoiding paths with nodes that cover all vertices of a convex n-gon; one-node paths are allowed. A359405
Number of unordered triples of self-avoiding paths with nodes that cover all vertices of a convex n-gon; one-node paths are allowed. A360021
Irregular triangle read by rows: The n-th row contains 2n integers corresponding to the words of the n-bit Gray code with the most significant bits changing fastest. A362160
Number of unordered quadruples of self-avoiding paths with nodes that cover all vertices of a convex n-gon. A360275
Number of unordered quadruples of self-avoiding paths with nodes that cover all vertices of a convex n-gon; one-node paths are allowed. A360276
Number of non-congruent simple polygons with 2n sides on the unbounded chessboard such that each side is an edge of the corresponding knight graph. A368499