Properties of the Number -53240

Fifty-Three Thousand Two Hundred Forty

Basics

Value: -53241 → -53240 → -53239

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 ³ × 5 × 11 ³

Divisors: 1, 2, 4, 5, 8, 10, 11, 20, 22, 40

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1100111111111000

Octal: -147770

Duodecimal: -26988

Hexadecimal: -cff8

Square: 2834497600

Square Root: 230.73794659743334

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

Array read by antidiagonals: T(n,k) is the number of binary rooted trees with n leaves of k colors and all non-leaf nodes having out-degree 2. A319539

a(n) = 5·n³. A244725

Wiener index of the grid P_n x P_n, where P_n is the path graph on n vertices. A143945

Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 443", based on the 5-celled von Neumann neighborhood. A288334

Number of rooted binary MUL-trees with n leaves on the label set [4]. A220817

Composite numbers divisible by the palindromic sum of their palindromic prime factors (counted with multiplicity). A46366

a(n) = ((n-th prime)⁵-(n-th prime)³)/3. A138433

Numbers k such that the sum of prime factors of k (counted with multiplicity) equals four times the largest prime divisor of k. A212862

a(n) = ∑_{k=1..n², gcd(n,k) = 1} k. A308474

Table T(n,k) = φ(φ(prime(n)^k)), n >= 1, k >= 0, read by upwards antidiagonals, where φ = A000010. A380500