Properties of the Number 53382

Fifty-Three Thousand Three Hundred Eighty-Two

Basics

Value: 53381 → 53382 → 53383

Parity: even

Prime: No

Previous Prime: 53381

Next Prime: 53401

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 7 × 31 × 41

Divisors: 1, 2, 3, 6, 7, 14, 21, 31, 41, 42

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1101000010000110

Octal: 150206

Duodecimal: 26A86

Hexadecimal: d086

Square: 2849637924

Square Root: 231.0454500742224

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

a(n) = 441·n² + 21. A158603

a(n) = 121·n² + n. A173267

Numbers n such that the sum of the distinct prime divisors of n that are congruent to 1 mod 4 equals the sum of the distinct prime divisors congruent to 3 mod 4. A215949

Numbers k such that A360331(k) = A360331(k+1). A360359

Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 22. A31700

Numbers k such that in the 3 X 3 square arrangement of the 9 primes p(k),..,p(k+8), totals of 3 rows and 3 columns, are all prime. A115050

Number of set partitions T'_t(n) of {1,2,...,t} into exactly n parts, with an even number of elements in each part distinguished by marks, and such that no part contains both 1 and t with 1 unmarked or both i and i+1 with i+1 unmarked for some i with 1 <= i < t; triangle T'_t(n), t>=0, 0<=n<=t, read by rows. A261318

Numbers of the form A000217(n)*A007494(n) that are divisible by 3. A295867

Composite squarefree integers for which the sum of the squares of their factors is a square. A379780

a(1) = 1; a(n+1) = sum of terms in continued fraction for sum of continued fractions, [a(n); a(n-1), a(n-2),...,a(1)] and [0; a(n), a(n-1), a(n-2),...,a(1)]. A58083