Properties of the Number 52130

Fifty-Two Thousand One Hundred Thirty

Basics

Value: 52129 → 52130 → 52131

Parity: even

Prime: No

Previous Prime: 52127

Next Prime: 52147

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 2 × 5 × 13 × 401

Divisors: 1, 2, 5, 10, 13, 26, 65, 130, 401, 802

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100101110100010

Octal: 145642

Duodecimal: 26202

Hexadecimal: cba2

Square: 2717536900

Square Root: 228.31995094603536

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 T(n,k) of tilings of a 5 X n rectangle with pentominoes of any shape and exactly k pentominoes of shape L; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A247704

Number of lower triangles of a 5 X 5 0..n array with each element differing from all of its horizontal and vertical neighbors by one. A195001

a(n) = the fractional part of 1 / A003592(n) read backwards. A299025

Numbers k that divide 9^k + 7^k. A45605

Numbers divisible by the sum of factorials of their digits [A061602(n)] and also terminate in the sum of factorials of their digits. A71064

a(n) is the optimal wire-length for an n X n grid. A195647

a(n) is the number of numbers between 1 and 2^m with m-n prime factors (counted with multiplicity), for m sufficiently large. A52130

Triangle T, read by rows, that satisfies: T(n,k) = [T²](n-1,k) for n>k+1>=1, with T(n,n) = 1 and T(n+1,n) = n+1 for n>=0, where T² is the matrix square of T. A109152

G.f.: A(x) = 1 + x*(1 + x*(1 + x*(...(1 + x*(...)^-2n )...)^-6)^-4)^-2. A138210