Properties of the Number 68464

Sixty-Eight Thousand Four Hundred Sixty-Four

Basics

Value: 68463 → 68464 → 68465

Parity: even

Prime: No

Previous Prime: 68449

Next Prime: 68473

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 2 ⁴ × 11 × 389

Divisors: 1, 2, 4, 8, 11, 16, 22, 44, 88, 176

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10000101101110000

Octal: 205560

Duodecimal: 33754

Hexadecimal: 10b70

Square: 4687319296

Square Root: 261.65626306282064

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) = T(n,n), array T as in A050143. A50146

Coordination sequence for 8-dimensional cubic lattice. A8416

Number of symmetric Schroeder paths of length 2n (A Schroeder path of length 2n is a lattice path from (0,0) to (2n,0) consisting of U=(1,1), D=(1,-1) and H=(2,0) steps and never going below the x-axis). A110110

T(n,k) is the coordination number of the (n+1)-dimensional cubic lattice for radius k; triangle read by rows, n>=0, 0<=k<=n. A343599

Number of points of L1 norm 7 in cubic lattice Zⁿ. A35601

Triangle read by rows: T(n,k) (0 <= k <= n) is the number of Delannoy paths of length n that start with exactly k (0,1) steps (or, equivalently, with exactly k (1,0) steps). A110171

Triangle G(n,k) read by rows: number of order-preserving partial transformations (of an n-element totally ordered set) of waist k (waist(α) = max(Im(α))). A111516

T(n, k) = (n + 1)*2^{n + k}*hypergeom([-n, k - n + 1], [2], 1/2), triangle read by rows for 0 <= k <= n. A337617

Square array A(n,r), the number of neighbors at a sharp Manhattan distance r in a finite n-hypercube lattice, read by upwards antidiagonals; A(n,r) = ∑_{k=0..min(n,r)} binomial(r-1,k-1)*binomial(n,k)* 2^k. A266213

Array of coordination sequences for cubic lattices (rows) and of numbers of L1 forms in cubic lattices (columns) (array read by antidiagonals). A119800