Properties of the Number 53769

Fifty-Three Thousand Seven Hundred Sixty-Nine

Basics

Value: 53768 → 53769 → 53770

Parity: odd

Prime: No

Previous Prime: 53759

Next Prime: 53773

Digit Sum: 30

Digital Root: 3

Palindrome: No

Factorization: 3 × 17923

Divisors: 1, 3, 17923, 53769

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 1101001000001001

Octal: 151011

Duodecimal: 27149

Hexadecimal: d209

Square: 2891105361

Square Root: 231.8814352206748

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 of n-length words on alphabet {0,1,...,8} with no subwords ii, for i from {0,1}. A254598

T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock summing to 1 2 3 4 5 6 or 7. A251373

Number of (n+1) X (1+1) 0..2 arrays with every 2 X 2 subblock summing to 1 2 3 4 5 6 or 7. A251366

Number of non-abelian groups of order prime(n)⁶. A271811

Number of 0..n arrays of length 5 with 0 never adjacent to n. A212838

Number of length 6+2 0..n arrays with every three consecutive terms having the sum of some two elements equal to twice the third. A248439

Number of (n+1)X(4+1) 0..2 arrays with every 2X2 subblock summing to 1 2 3 4 5 6 or 7. A251369

Number of minimal edge covers in the n-prism graph. A290700

Triangle read by rows, T(n, k) = 2^{n - k}*M(n, k, 1/2, 1/2), where M(n, k, x, y) is a generalized Motzkin recurrence. T(n, k) for 0 <= k <= n. A344557

T(n,k)=Number of 0..k arrays of length n+1 with 0 never adjacent to k. A212835