Properties of the Number 50673

Fifty Thousand Six Hundred Seventy-Three

Basics

Value: 50672 → 50673 → 50674

Parity: odd

Prime: No

Previous Prime: 50671

Next Prime: 50683

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 7 × 19 × 127

Divisors: 1, 3, 7, 19, 21, 57, 127, 133, 381, 399

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100010111110001

Octal: 142761

Duodecimal: 253A9

Hexadecimal: c5f1

Square: 2567752929

Square Root: 225.10664139469543

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

Numbers k such that k³ divides 4^k² - 1. A129212

53 'Reverse and Add' steps are needed to reach a palindrome. A65320

Reduced partially ordered sets (posets) with n labeled elements. A66302

Number of (n+2) X (1+2) 0..1 arrays with no 3·3 subblock diagonal sum 1 and no antidiagonal sum 1 and no row sum 0 or 1 and no column sum 0 or 1. A255152

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 1), (0, 0, -1), (1, 0, 1), (1, 1, 0)}. A150769

a(n) is the smallest prime such that the number of primes produced according to rules stipulated in Honaker's A048853 is n. A50673

T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with no 3x3 subblock diagonal sum 1 and no antidiagonal sum 1 and no row sum 0 or 1 and no column sum 0 or 1. A255159

Square array A(n, k) = σ((2n-1)²) * σ((2k-1)²), read by antidiagonals. A379220