Properties of the Number 51065

Fifty-One Thousand Sixty-Five

Basics

Value: 51064 → 51065 → 51066

Parity: odd

Prime: No

Previous Prime: 51061

Next Prime: 51071

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 5 × 7 × 1459

Divisors: 1, 5, 7, 35, 1459, 7295, 10213, 51065

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100011101111001

Octal: 143571

Duodecimal: 25675

Hexadecimal: c779

Square: 2607634225

Square Root: 225.97566240637508

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

Place a point on the integer coordinates, up to |n|, along all four axial directions on a Cartesian plane, and then join an infinite straight line between every pair of points: a(n) is the number of points where lines intersect in the resulting graph. A386559

Triangular array, read by rows: T(n,k) = [(x·y)^k] (-1 + (1 + x + 1/x)*(1 + y + 1/y))ⁿ for -n <= k <= n. A329816

Decimal part of cube root of a(n) starts with 1: first term of runs. A34127

a(n) = n*(n+1)*(15·n²-n-8)/12. A172047

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 1", based on the 5-celled von Neumann neighborhood. A269908

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 405", based on the 5-celled von Neumann neighborhood. A271814

a(n) = A004128(n) mod 2. A51065

Largest value in trajectory when the following modified juggler map is iterated: a[n]=(1-Mod[n, 2])*Floor[n^3/4]+Mod[n, 2]*Floor[n^4/3]; original exponents {1/2, 3/2} are replaced with {3/4, 4/3}. A95400

number of steps required to reach 1 if the following modified juggler map is iterated: a[n]=(1-Mod[n, 2])*Floor[n^3/4]+Mod[n, 2]*Floor[n^4/3]; original exponents {1/2, 3/2} are replaced with {3/4, 4/3}. A95401