Properties of the Number 51521

Fifty-One Thousand Five Hundred Twenty-One

Basics

Value: 51520 → 51521 → 51522

Parity: odd

Prime: Yes

Previous Prime: 51517

Next Prime: 51539

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 51521

Divisors: 1, 51521

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100100101000001

Octal: 144501

Duodecimal: 25995

Hexadecimal: c941

Square: 2654413441

Square Root: 226.98237817064125

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

Primes having only {1, 2, 5} as digits. A385773

Primes p such that φ(p+1) = φ(φ(p-1)+1). A271655

Primes of the form 50n² + 10n + 1. A154428

Numbers n such that n²⁰⁴⁸ + (n+1)²⁰⁴⁸ is prime. A274235

Primes of the form 8·n² + 4·n + 1. A102130

Number of 6Xn -1,1 arrays such that the sum over i=1..6,j=1..n of i·x(i,j) is zero and rows are nondecreasing (ways to put n thrusters pointing east or west at each of 6 positions 1..n distance from the hinge of a south-pointing gate without turning the gate). A225313

Primes of the form k!9 + 1, where k!9 is the nonuple factorial number (A114806). A288371

Primes p such that 2p-1 is a square and 2p+1 is also prime. A386995

a(n) = a(n-1) + a(a(n-1) mod n) + 1, a(0) = 1. A308576

Number of ways to represent n as k/d(k), where d(k) = A000005(k) is the number of divisors of k. A51521