Properties of the Number -54213

Fifty-Four Thousand Two Hundred Thirteen

Basics

Value: -54214 → -54213 → -54212

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 17 × 1063

Divisors: 1, 3, 17, 51, 1063, 3189, 18071, 54213

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1101001111000101

Octal: -151705

Duodecimal: -27459

Hexadecimal: -d3c5

Square: 2939049369

Square Root: 232.83685275316705

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

a(n) = ∑_k=0..n (4·k+1) * binomial(3·n+k+1,n-k)/(3·n+k+1). A390519

O.g.f.: ∑_n>=0 n!*(x/(1+x)²)ⁿ. A127548

Number of scalene triangles, distinct up to congruence, on an n X n grid (or geoboard). A190313

Number of partitions of n such that (least part) = (multiplicity of greatest part). A240180

Partial sums of icosahedral numbers (A006564). A302560

Numbers k such that φ(k)+σ(k) is a perfect cube. A61366

Row sums of Riordan array (c(-x²),xc(-x²)²)^-1 where c(x) is the g.f. of A000108. A138164

Number of dispersed Dyck paths of length n (i.e., Motzkin paths of length n with no (1,0) steps at positive heights) having only ascents of even length (an ascent is a maximal sequence of consecutive (1,1)-steps). A191321

Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths ending at each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 9, n >= 2. A214376