Properties of the Number 68320

Sixty-Eight Thousand Three Hundred Twenty

Basics

Value: 68319 → 68320 → 68321

Parity: even

Prime: No

Previous Prime: 68311

Next Prime: 68329

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 ⁵ × 5 × 7 × 61

Divisors: 1, 2, 4, 5, 7, 8, 10, 14, 16, 20

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 10000101011100000

Octal: 205340

Duodecimal: 33654

Hexadecimal: 10ae0

Square: 4667622400

Square Root: 261.38094804327267

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

Number of ways of writing n as a sum of 7 squares. A8451

Position of first appearance of zero in the n-th differences of the prime-powers (A246655), or 0 if it does not appear. A377055

T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with every 3X3 subblock row, column, diagonal and antidiagonal sum not equal to 0 1 or 4. A252293

Number of isomorphism classes of connected 3-regular loopless multigraphs with n vertices and with semi-edges allowed. A243391

Triangle T(n,k) (n >= 2, 2 <= k <= n-1 if n > 2) giving number of non-crossing trees with n nodes and k endpoints. A72247

a(n) = 441·n² - 488·n + 135. A157730

Left part of the square of the n-th Kaprekar number. A194218

Number of isomorphism classes of connected 3-regular simple graphs of order 2n with loops and semi-edges allowed. A243392

Number of unlabeled connected loopless multigraphs with n nodes of degree 3 or less and with single or double edges. A303030

Numbers k such that sopfr(k + ω(k)) = sopfr(k), where sopfr(i) = A001414(i) and ω(i) = A001221(i). A187878