Properties of the Number 53116

Fifty-Three Thousand One Hundred Sixteen

Basics

Value: 53115 → 53116 → 53117

Parity: even

Prime: No

Previous Prime: 53113

Next Prime: 53117

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 ² × 7 ² × 271

Divisors: 1, 2, 4, 7, 14, 28, 49, 98, 196, 271

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100111101111100

Octal: 147574

Duodecimal: 268A4

Hexadecimal: cf7c

Square: 2821309456

Square Root: 230.4690868641606

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

Iccanobif numbers: add previous two terms and reverse the sum, starting with 0, 1. A14258

a(n) = ∑_k=0..n (-1)^n-k * C(n,k) * Stirling1(n+1, k+1). A247329

Total sum of parts of multiplicity 10 in all partitions of n. A222738

Triangle read by rows, T(n,k) = ∑_j=0..n (-1)^n-j*C(-j,-n)*S1(k,j), S1 the Stirling cycle numbers A132393, for n>=0 and 0<=k<=n. A271699

a(n) = ((9·n+10)(!⁹))/10, related to A045756 ((9·n+1)(!⁹) 9-factorials). A53116

Array read by downward antidiagonals: T(n,k) is the number of partitions of [n], n >= 1, k >= 1, into cycles labeled with positive integers, such that the labels sum to k. A388788