Properties of the Number 53597

Fifty-Three Thousand Five Hundred Ninety-Seven

Basics

Value: 53596 → 53597 → 53598

Parity: odd

Prime: Yes

Previous Prime: 53593

Next Prime: 53609

Digit Sum: 29

Digital Root: 2

Palindrome: No

Factorization: 53597

Divisors: 1, 53597

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1101000101011101

Octal: 150535

Duodecimal: 27025

Hexadecimal: d15d

Square: 2872638409

Square Root: 231.51025895195227

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 of the form prime(i)*prime(i+1) + prime(i+2) + 1. A180945

Let p(k) denote k-th prime; consider solutions (p(n),p(m)) of Diophantine equation p(p(n)+1)-6.p(p(m))=1 (*), where p(p(n)) belongs to A060213 and p(p(m))=(p(p(n))+1)/6; sequence gives values of p(n). A65505

a(n) = 137·n² - 4043·n + 27277. A267706

Number of unlabeled connected multigraphs with n edges, no cut-points and degree >= 3 at each node, loops allowed. A360882

Primes of the form k*(k+2)/3 - 3, k>2. A262203

Let prime(i) = i-th prime (A000040), let d(i) = prime(i+1)-prime(i) (A001223); a(n) = number of distinct numbers among d(n), d(n+1), d(n+2), ... before first duplicate is encountered. A53597