Properties of the Number 50080

Fifty Thousand Eighty

Basics

Value: 50079 → 50080 → 50081

Parity: even

Prime: No

Previous Prime: 50077

Next Prime: 50087

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 ⁵ × 5 × 313

Divisors: 1, 2, 4, 5, 8, 10, 16, 20, 32, 40

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100001110100000

Octal: 141640

Duodecimal: 24B94

Hexadecimal: c3a0

Square: 2508006400

Square Root: 223.78561169118984

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) = ∑_{d∣n, n/d=1 mod 4} d⁴ - ∑_{d∣n, n/d=3 mod 4} d⁴. A50468

Expansion of 1/(1 - ∑_k>=1 k!*x^k*(k+1/2) / ∏_j=1..k (1 - x^j)). A307068

a(n) = ∑_{d∣n, d==1 mod 4} d⁴ - ∑_{d∣n, d==3 mod 4} d⁴. A50456

a(n) = usigma(A276086(n)), where usigma (A034448) is multiplicative with a(p^e) = (p^e)+1, and A276086 gives the prime product form of primorial base expansion of n. A348996

Least k such that the first k terms of A006928 contain n more 2's than 1's. A25507

a(n) = (-1)ⁿ * ∑_{2·m + 1 | 2·n + 1} (-1)^m (2·m + 1)⁴. A204342

1/56 of the number of permutations of 7 indistinguishable copies of 1..n with exactly 2 local maxima. A152517

Decimal expansion of π¹²/12!, the absolute density of the Leech lattice. A260646

a(n) = floor(a(n-1)/3) if this is not among 0, a(1), ..., a(n-2); otherwise a(n) = 4·a(n-1). A50080

Decimal expansion of (π/(6·sqrt(3)))^1/3, the sphericity of the tetrahedron. A273633

We use cookies

Some cookies are essential for Natory to function, like keeping you signed in. We also use optional cookies to understand how the app is used and improve it over time. Learn more in our Privacy Policy. You can manage your preferences anytime.