Properties of the Number 53863

Fifty-Three Thousand Eight Hundred Sixty-Three

Basics

Value: 53862 → 53863 → 53864

Parity: odd

Prime: No

Previous Prime: 53861

Next Prime: 53881

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 61 × 883

Divisors: 1, 61, 883, 53863

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1101001001100111

Octal: 151147

Duodecimal: 27207

Hexadecimal: d267

Square: 2901222769

Square Root: 232.08403650402153

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

T(n,k)=Number of nXk 0..1 arrays with every element unequal to 1, 2, 4, 5, 6 or 8 king-move adjacent elements, with upper left element zero. A316455

Counterbalanced numbers: Composite numbers k such that φ(k)/(σ(k)-k) is an integer. A55940

Number of n X 6 0..1 arrays with every element unequal to 1, 2, 4, 5, 6 or 8 king-move adjacent elements, with upper left element zero. A316453

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, 0), (1, 0, -1), (1, 0, 1), (1, 1, 0)}. A150755

Number of nXn 0..1 arrays with every element unequal to 1, 2, 4, 5, 6 or 8 king-move adjacent elements, with upper left element zero. A316449

Triangle of number of connected graphs with k >= 1 edges and n nodes (2 <= n <= k+1). A46742

Number of n X n matrices over GF(4) of order dividing 8 (i.e., number of solutions of X⁸=I in GL(n,4)). A53863