Properties of the Number 50655

Fifty Thousand Six Hundred Fifty-Five

Basics

Value: 50654 → 50655 → 50656

Parity: odd

Prime: No

Previous Prime: 50651

Next Prime: 50671

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 5 × 11 × 307

Divisors: 1, 3, 5, 11, 15, 33, 55, 165, 307, 921

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100010111011111

Octal: 142737

Duodecimal: 25393

Hexadecimal: c5df

Square: 2565929025

Square Root: 225.06665679304876

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³ + 2. A84380

T(n,k) = Number of n X k 0..1 arrays with the number of 1's king-move adjacent to some 0 two less than the number of 0's adjacent to some 1. A286216

a(n) = n*(n³ + 2). A185065

a(n) = ∑_d∣n sigma₃(d). A321140

a(n) = (n-1)*(n-2)*(n-3) + n. A34324

a(n) = 225n² + 2n. A158228

a(n) is the smallest number k such that k·2^2ⁿ + 1 is prime. A30239

Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 15. A31693

Triangle read by rows: T(n,k) (0 <= k <= floor(n/2)) is the number of lattice paths from (0,0) to (2n,0) consisting of steps U=(1,1), D=(1,-1), H=(2,0), never going below the x-axis (i.e., Schroeder paths) and having k UH's. A110220

Numbers k such that k and k² use only the digits 0, 2, 5, 6 and 9. A136914