Properties of the Number 53466

Fifty-Three Thousand Four Hundred Sixty-Six

Basics

Value: 53465 → 53466 → 53467

Parity: even

Prime: No

Previous Prime: 53453

Next Prime: 53479

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 2 × 3 × 7 × 19 × 67

Divisors: 1, 2, 3, 6, 7, 14, 19, 21, 38, 42

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1101000011011010

Octal: 150332

Duodecimal: 26B36

Hexadecimal: d0da

Square: 2858613156

Square Root: 231.2271610343387

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

q-factorial numbers 3!_q. A69778

Number of different groupings among the hierarchical orderings of n unlabeled elements. A104500

Antidiagonal sums of the convolution array A213833. A213834

a(n) = n*(n + 1)*(11·n² + 11·n - 10)/24. A264854

Number of 0..n arrays of length 5 with each element differing from at least one neighbor by something other than 1, starting with 0. A221543

a(n) = m is the least m = b·c > a(n-1) such that (b+c)*n = m-1 where 1 < b <= c < m. A364171

G.f.: Product((1+xⁱ)/(1-xⁱ),i=1..n-1)/(1-xⁿ), with n = 8. A91779

Number of permutations of floor(i·3/2), i=0..n-1, with all sums of 2 through 4 adjacent terms respectively unique. A147900

Number of permutations of floor(i·3/2), i=0..n-1, with all sums of 2 through 5 adjacent terms respectively unique. A147908

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