Properties of the Number -52412

Fifty-Two Thousand Four Hundred Twelve

Basics

Value: -52413 → -52412 → -52411

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 ² × 13103

Divisors: 1, 2, 4, 13103, 26206, 52412

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1100110010111100

Octal: -146274

Duodecimal: -263B8

Hexadecimal: -ccbc

Square: 2747017744

Square Root: 228.93667246642684

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

Reduced numerators of x²ⁿ in the series expansion of erf(x)² π/4 about 0. A103979

Irregular triangular array read by rows. Let S_n be the set of labeled graphs G on [n] with 2-colored nodes where black nodes are only connected to white nodes and vice versa. Orient the edges in each such graph G from black to white. T(n,k) is the number of graphs in S_n containing exactly k descents, n>=0, 0<=k<=A002620(n). A381058

a(n) = (2^n-1)*(Integral_x=0..1 (1+x²)ⁿ dx)/(Integral_x=0..1 (1-x²)ⁿ dx). A88854

Numbers n such that σ(n) = σ(n - φ(n)), where σ(n) is the sum of divisors of n and φ(n) is the Euler totient function of n. A228519