Properties of the Number 50315

Fifty Thousand Three Hundred Fifteen

Basics

Value: 50314 → 50315 → 50316

Parity: odd

Prime: No

Previous Prime: 50311

Next Prime: 50321

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 5 × 29 × 347

Divisors: 1, 5, 29, 145, 347, 1735, 10063, 50315

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100010010001011

Octal: 142213

Duodecimal: 2514B

Hexadecimal: c48b

Square: 2531599225

Square Root: 224.31005327447988

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) is the number of positive integers k for which ∑_i=1..j (p_i+e_i) = n, where p₁^e_1*...*p_j^e_j is the prime factorization of k. A382330

Number of n-element unlabeled connected N-free posets. A202180

Numerators of continued fraction convergents to sqrt(490). A41934

Imbalance of the sum of largest parts of all partitions of n. A194809

a(n) = n*(n + 1)*(n² + 17·n + 54)/24. A387204

Number of button presses required to try every combination of a binary combination lock with n number buttons. A247374

Triangle read by rows: T(n,k) is the number of n-element unlabeled N-free posets with k connected components. A350783

Main diagonal of A050314. A50315

Square array A(n, k) = A048720(A065621(σ((2n-1)²)), σ((2k-1)²)), read by falling antidiagonals, (1,1), (1,2), (2,1), (1,3), (2,2), (3,1), etc. A379221

Continued fraction expansion of a constant r such that the odd-indexed bisection equals the continued fraction of 2·r, with an even-indexed bisection of all 2's. A322728