Properties of the Number 52854

Fifty-Two Thousand Eight Hundred Fifty-Four

Basics

Value: 52853 → 52854 → 52855

Parity: even

Prime: No

Previous Prime: 52837

Next Prime: 52859

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 2 × 3 × 23 × 383

Divisors: 1, 2, 3, 6, 23, 46, 69, 138, 383, 766

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1100111001110110

Octal: 147166

Duodecimal: 26706

Hexadecimal: ce76

Square: 2793545316

Square Root: 229.89997825141262

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

Numbers m such that the factorizations of m..m+4 have the same number of primes (including multiplicities). A45941

G.f. satisfies A(x) = 1 + x·A(x * (1 + x²)). A360885

Numbers k such that k, k+1, k+2 and k+3 are products of 4 primes. A124728

a(n) = 100·n² - 2·n. A158129

Lesser of 2 successive tetraprimes (k, k+4) sandwiching three consecutive not squarefree numbers. A367791

Smallest member of cycle corresponding to n-th term of A165127. A165128

Consider the base-9 Kaprekar map n->K(n) defined in A165110. Sequence gives least elements of each cycle, including fixed points. A165119

Consider the base-9 Kaprekar map n->K(n) defined in A165110. Sequence gives least elements of each cycle of length > 1. A165121

Consider the base-9 Kaprekar map x->K(x) described in A165110. Sequence gives the smallest number that belongs to a cycle of length n under repeated iteration of this map, or -1 if there is no cycle of length n. A165126

Number of forests of ordered trees on n total nodes. A52854