Properties of the Number 51492

Fifty-One Thousand Four Hundred Ninety-Two

Basics

Value: 51491 → 51492 → 51493

Parity: even

Prime: No

Previous Prime: 51487

Next Prime: 51503

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 ² × 3 × 7 × 613

Divisors: 1, 2, 3, 4, 6, 7, 12, 14, 21, 28

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 1100100100100100

Octal: 144444

Duodecimal: 25970

Hexadecimal: c924

Square: 2651426064

Square Root: 226.91848756767263

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

Total number of red nodes among tricolored labeled trees on n nodes. A97174

Array read by antidiagonals: T(n,m) is the number of acyclic edge covers of the complete bipartite graph K_n,m. A328888

Rewrite 0->100 in the binary expansion of n. A80303

Number of (w,x,y,z) with all terms in {0,...,n} and |w-x|+|x-y+|y-z|=n. A212904

T(n,k)=Number of nXk 0..1 arrays with every element equal to 2, 3, 6 or 8 king-move adjacent elements, with upper left element zero. A298177

E.g.f. A(x) satisfies: A(x)^A(x) = LambertW(-x)/(-x). A276231

Continued fraction for Otter's rooted tree constant: lim_n->inf A000081(n+1)/A000081(n). A51492

Expansion of g.f. A(x) = 1/F(oo,x) where F(oo,x) is the limit of the process F(n,x) = (F(n-1,x)^2ⁿ - 4ⁿ*xⁿ)^1/2ⁿ for n > 0, starting with F(0,x) = 1. A361769