Properties of the Number -52060

Fifty-Two Thousand Sixty

Basics

Value: -52061 → -52060 → -52059

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 ² × 5 × 19 × 137

Divisors: 1, 2, 4, 5, 10, 19, 20, 38, 76, 95

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1100101101011100

Octal: -145534

Duodecimal: -26164

Hexadecimal: -cb5c

Square: 2710243600

Square Root: 228.16660579497605

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) = n³ + n² + n + 1. A53698

Number of length n words on alphabet {0,1} such that the length of every maximal block of 0's (runs) is the same. A243815

Sum of divisors of cubes. A175926

Number of sublattices of index n in generic 4-dimensional lattice. A38991

a(n) = Z(S_m; σ[1](n), σ[2](n),..., σ[m](n)) where Z(S_m; x₁,x₂,...,x_m) is the cycle index of the symmetric group S_m and σ[k](n) is the sum of k-th powers of divisors of n; m=3. A68020

a(n) = 1 + prime(n) + prime(n)² + prime(n)³. A131991

a(n) = (37ⁿ - 1)/36. A218740

The sum of divisors of the smallest cubefull number that is a multiple of n. A369720

a(n) = ∑_d∣n Moebius(n/d)*d^b-1/φ(n) for b = 5. A160891

The sum of divisors of the smallest cubefull exponentially odd number that is divisible by n. A369758