Properties of the Number 50260

Fifty Thousand Two Hundred Sixty

Basics

Value: 50259 → 50260 → 50261

Parity: even

Prime: No

Previous Prime: 50231

Next Prime: 50261

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 ² × 5 × 7 × 359

Divisors: 1, 2, 4, 5, 7, 10, 14, 20, 28, 35

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100010001010100

Octal: 142124

Duodecimal: 25104

Hexadecimal: c454

Square: 2526067600

Square Root: 224.18742159184578

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

T(n,k)=Number of length n+4 0..k arrays with no five consecutive terms having two times the sum of any three elements equal to three times the sum of the remaining two. A249001

Length of list created by n substitutions k -> Range( -abs(k+1), abs(k-1), 2) starting with {1}. A84075

Triangle, read by rows, defined by T(n,k) = T(n-1,k) + T(n,k-1) for nk>0, where T(n,0) = T(n-1,0) + T(n-1,n-1) and T(n,n) = T(n,n-1) for n>0 with T(0,0)=1. A129577

Members of a pair (m,k) such that σ(m) = σ(k) = σ(m+k), m < k where σ = A000203. A239436

Numbers·such that σ(x) = σ(y), with x<>y, where y is the 10's complement mod 10 of the digits of x. A300447

Number of length 1+4 0..n arrays with no five consecutive terms having two times the sum of any three elements equal to three times the sum of the remaining two. A249002

Least K such that K*(3^n+j)+1 is prime for j=0 to 4. A109854

Quiteprimes: numbers k such that |2*(k mod p) - p| <= p + 1 - sqrt(p) for all primes p <= sqrt(k). A50260