Properties of the Number -53109

Fifty-Three Thousand One Hundred Nine

Basics

Value: -53110 → -53109 → -53108

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ³ × 7 × 281

Divisors: 1, 3, 7, 9, 21, 27, 63, 189, 281, 843

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1100111101110101

Octal: -147565

Duodecimal: -26899

Hexadecimal: -cf75

Square: 2820565881

Square Root: 230.4538999453036

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

Late-growing permutations: number of permutations of 1..n with every partial sum <= the same partial sum averaged over all permutations. A147681

a(n) = binomial(n+2,2) + binomial(n+3,3) + binomial(n+4,4) + binomial(n+5,5). A27659

a(n) is the number of partitions of n with Durfee square of size <= 5. A330643

Table read by antidiagonals: Place k points in general position on each side of a regular n-gon and join every pair of the n*(k+1) boundary points by a chord; T(n,k) (n >= 3, k >= 0) gives number of regions in the resulting planar graph. A366253

Sum over all multiplicative partitions μ of n whose sum is also n (with factors >= 1), of the encoding as ∏_{j in μ} prime(j). A377853

Duplicate of A147681. A145874