Properties of the Number 53822

Fifty-Three Thousand Eight Hundred Twenty-Two

Basics

Value: 53821 → 53822 → 53823

Parity: even

Prime: No

Previous Prime: 53819

Next Prime: 53831

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 × 17 × 1583

Divisors: 1, 2, 17, 34, 1583, 3166, 26911, 53822

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1101001000111110

Octal: 151076

Duodecimal: 27192

Hexadecimal: d23e

Square: 2896807684

Square Root: 231.99568961513057

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

Square array read by antidiagonals upwards: T(n,k) is the number of scenarios for the gift exchange problem in which each gift can be stolen at most once, when there are n gifts in the pool and k gifts (not yet frozen) in peoples' hands. A144502

Row 2 of array in A144502. A144495

Number of sets of distinct primes, the greatest of which is prime(n), whose arithmetic mean is an integer. A82552

Numbers that are equal to the sum of the number of divisors of their first k arithmetic derivatives, for some k. A269459

Dirichlet inverse of sigma₂ function (A001157). A53822

Triangle T(n, k, m) = t(n,m)/( t(k,m) * t(n-k,m) ) with T(n, 0, m) = T(n, n, m) = 1, where t(n, m) = ∏_j=1..n ∏_i=1..j-1 ( 1 - (m+1)*(2·i-1) ) and m = 1, read by rows. A156696