Properties of the Number 51853

Fifty-One Thousand Eight Hundred Fifty-Three

Basics

Value: 51852 → 51853 → 51854

Parity: odd

Prime: Yes

Previous Prime: 51839

Next Prime: 51859

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 51853

Divisors: 1, 51853

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100101010001101

Octal: 145215

Duodecimal: 26011

Hexadecimal: ca8d

Square: 2688733609

Square Root: 227.71253808255707

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

Denominators of lower primes-only best approximates (POBAs) to π; see Comments. A265809

Denominators of primes-only best approximates (POBAs) to π; see Comments. A265813

Triangle of coefficients T(n,k) in g.f. A(x,y) satisfying ∑_n=-oo..+oo (-1)ⁿ * (xⁿ + y·A(x,y))ⁿ = 1 + (y+2)*∑_n>=1 (-1)ⁿ * x^n², for n >= 1, as read by rows. A370040

Number of partitions p = [x(1), ..., x(k)], where x(1) >= x(2) >= ... >= x(k), of n such that max(x(i) - x(i-1)) is a part of p. A241735

Smallest prime == 1 (mod f(n)), where f(n) = concatenation n,n-1,...,3,2,1. A109948

a(n) = n-th smallest prime congruent to 1 modulo prime(n). A234387

Table of solutions to all possible Chinese Remainder Equations x = a1 mod p1, x = a2 mod p2, ..., x = an mod pn, where p1 - pn are the first n primes and each a1 - an varies between 1 and (its respective) p-1, with the leftmost a varying fastest. A51853