Properties of the Number 52391

Fifty-Two Thousand Three Hundred Ninety-One

Basics

Value: 52390 → 52391 → 52392

Parity: odd

Prime: Yes

Previous Prime: 52387

Next Prime: 52433

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 52391

Divisors: 1, 52391

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100110010100111

Octal: 146247

Duodecimal: 2639B

Hexadecimal: cca7

Square: 2744816881

Square Root: 228.8908036597364

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

Base-6 pandigital primes: primes having at least one of each digit 0,1,2,3,4,5 when written in base 6. A175278

Primes p such that q-p = 42, where q is the next prime after p. A134120

Lexicographically largest increasing sequence of primes for which the continued square root map (see A257574) produces π. A257582

Primes p such that none of p-2, p-1, p+1, and p+2 is squarefree. A153215

Least prime k such that x' = k has n solutions, where x' is the arithmetic derivative (A003415) of x. A189559

Primes p giving prime quadruples (30p+11, 30p+13, 30p+17, 30p+19). A87771

Primes of the form prime(k)² - k. A227890

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 467", based on the 5-celled von Neumann neighborhood. A272320

Smallest prime(k) such that 2ⁿ divides the product of composite numbers between prime(k) and prime(k+1) but 2ⁿ⁺¹ does not. A77216

prime(k) for those k where floor((2*(prime(k+1)-prime(k))*PrimePi(k) mod (8·k))/k) = m with m = 11. A109565