Properties of the Number 53152

Fifty-Three Thousand One Hundred Fifty-Two

Basics

Value: 53151 → 53152 → 53153

Parity: even

Prime: No

Previous Prime: 53149

Next Prime: 53161

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 ⁵ × 11 × 151

Divisors: 1, 2, 4, 8, 11, 16, 22, 32, 44, 88

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100111110100000

Octal: 147640

Duodecimal: 26914

Hexadecimal: cfa0

Square: 2825135104

Square Root: 230.547175215833

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 ways to write n as an ordered sum of 8 prime powers (including 1). A341137

Numbers k such that the digits of k², reversed, include the digits of k as a substring. A115761

a(n) = 1 + (144 + (50 + (35 + (10 + n)*n)*n)*n)*n/120. A145127

Number of regions in a regular drawing of a complete bipartite graph where the vertex positions on each part equal the Farey series of order n. A359692

Convolution of sequence of primes with sequence σ(n). A86718

a(n) = [xⁿ] (1/(1 - 2·x/(1 - 2·x/(1 - 4·x/(1 - 4·x/(1 - 6·x/(1 - 6·x/(1 - ...))))))))ⁿ, a continued fraction. A293471

Number of intersection types when n circular arcs pass through a single point, reduced for symmetry. A387988

Number of asymmetric (identity) trees with n nodes and 5 leaves. A55336

Multi-bifurcating recursion of a factorial type based on the Eulerian numbers A008292 as a triangle sequence: t(n,k) = ∑_j=0..k+1 (-1)^j * binomial(n + 1, j)*(k + 1 - j)ⁿ; f(n, m) = If[m <= floor(n/2), f(m, 1)*f(n - m, 1)*t(n + 1, m)]. A155556

a(n) = (-1)ⁿ*(n + 1)*(5·n² + 10·n + 1). A271532