Properties of the Number 55152

Fifty-Five Thousand One Hundred Fifty-Two

Basics

Value: 55151 → 55152 → 55153

Parity: even

Prime: No

Previous Prime: 55147

Next Prime: 55163

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 ⁴ × 3 ² × 383

Divisors: 1, 2, 3, 4, 6, 8, 9, 12, 16, 18

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1101011101110000

Octal: 153560

Duodecimal: 27B00

Hexadecimal: d770

Square: 3041743104

Square Root: 234.84462948937113

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 A(n,k) of permutations p of [n] such that the up-down signature of p has nonnegative partial sums with a maximal value <= k; square array A(n,k), n>=0, k>=0, read by antidiagonals. A262124

Triangle related to the divergent series 1^m*1! - 2^m*2! + 3^m*3! - 4^m*4! + ... for m >= -1. A163940

Fourth right hand column of triangle A163940. A163941

Number of permutations p of [n] such that the up-down signature of p has nonnegative partial sums with a maximal value <= 2. A262126

E.g.f. sinh(log(1+x))*log(1+x). A9575

Triangle read by rows: T(n,m) (n >= 1, 1 <= m <= n) = number of set partitions of [n], avoiding 12343, with m blocks. A250118

Numbers k such that the decimal digits of k*(k+1) are a permutation of those of k*(k-1). A181775

Irregular triangle read by rows: T(n,k) (n>=2, 1<=k<=n) gives number of arrangements of the elements from the multiset M(n, 2) into exactly k disjoint cycles. A245182

Convolution of Catalan numbers A000108(n+1), n >= 0, with A020918. A41005

Triangle read by rows. Let q(x,n) = -((x - 1)^{2·n + 1}/xⁿ)*Sum[(k + n)ⁿ*Binomial[k, n]*x^k, {k, 0, Infinity}]; p(x,n)=q(x,n)+xⁿ*q(1/x,n); then row n gives coefficients of p(x,n). A155951