Properties of the Number 53971

Fifty-Three Thousand Nine Hundred Seventy-One

Basics

Value: 53970 → 53971 → 53972

Parity: odd

Prime: No

Previous Prime: 53959

Next Prime: 53987

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 31 × 1741

Divisors: 1, 31, 1741, 53971

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: 1101001011010011

Octal: 151323

Duodecimal: 27297

Hexadecimal: d2d3

Square: 2912868841

Square Root: 232.3165943276545

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

Strong pseudoprimes to base 5. A20231

Euler pseudoprimes to base 5: composite integers such that abs(5^{(n - 1}/2)) == 1 mod n. A262052

Base-5 Euler-Jacobi pseudoprimes: odd composite k coprime to 5 such that 5^(k-1/2) == (5/k) (mod n), where (5/k) is the Jacobi symbol (or Kronecker symbol). A375914

Composite numbers k == 1, 9 (mod 10) such that 5^(k-1/2) == 1 (mod k). A375915

Positive numbers k such that the centered cube number k³ + (k+1)³ is equal to the difference of two positive cubes and to A352755(n). A352756

Numbers k such that 63·2^k-1 is prime. A50557

Number of edges in the directed graph for the Reversed Zeckendorf game with starting number n. A389617

Numbers k such that there are 10 digits in k² and for each factor f of 10 (1, 2, 5) the sum of digit groupings of size f is a square. A153748

Number of n X 2 arrays of the minimum value of corresponding elements and their horizontal or vertical neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..2 n X 2 array. A219589

Strong pseudoprimes to base 25. A20251