Properties of the Number 51102

Fifty-One Thousand One Hundred Two

Basics

Value: 51101 → 51102 → 51103

Parity: even

Prime: No

Previous Prime: 51071

Next Prime: 51109

Digit Sum: 9

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ² × 17 × 167

Divisors: 1, 2, 3, 6, 9, 17, 18, 34, 51, 102

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100011110011110

Octal: 143636

Duodecimal: 256A6

Hexadecimal: c79e

Square: 2611414404

Square Root: 226.05751480541406

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

Number of integer compositions of n with all distinct 0-based partial alternating sums. A392703

Numbers n which appear at least twice in A037278(n), concatenation of their divisors written in base 10. A248323

Number of n X n arrays of squares of integers summing to 40. A159445

G.f.: ∑_n>=0 xⁿ * ∏_k=1..n (1 - x^n+k)/(1 - x^k). A260894

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

Number of maximal cliques in the n-polygon diagonal intersection graph. A291949

Let P(n) = primorial(n) = A002110(n); a(n) is the number of primes q < P(n) such that P(n) - q is also prime and q²==1 (mod P(n)). A336093

Floor of exp(n-th prime). A51102

Number of 6 X n 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 1 1 and 1 1 0 vertically. A207491