Properties of the Number 51901

Fifty-One Thousand Nine Hundred One

Basics

Value: 51900 → 51901 → 51902

Parity: odd

Prime: No

Previous Prime: 51899

Next Prime: 51907

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 17 × 43 × 71

Divisors: 1, 17, 43, 71, 731, 1207, 3053, 51901

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100101010111101

Octal: 145275

Duodecimal: 26051

Hexadecimal: cabd

Square: 2693713801

Square Root: 227.81790974372493

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) is the number of rooted trees with 2n vertices n of whom are leaves. A185650

a(n) = numerator(N(1/2, n, 1)) where N(a, n, x) is the n-th Nørlund polynomial. A370416

a(n) is the denominator corresponding to A376736(n). A376737

f-vectors for simplicial complexes of dimension at most 2 on at most n-1 vertices. A11827

Number of rooted trees with n nodes and 8 leaves. A55283

a(n) = 3^n-1 - ceiling(nⁿ/n!). A127634

a(n) is the numerator of the expected number of random moves of a chess knight to reach a position outside an nXn chessboard, starting in one of the corners. A376736

Minimal factorial safe-primes: a prime p = a(n) here if (p-1)/n! = A051888(n). A51901

a(n) is the number of paths of a knight on square a1 to reach a position outside an 8 X 8 chessboard after n steps. A377018