Properties of the Number 68798

Sixty-Eight Thousand Seven Hundred Ninety-Eight

Basics

Value: 68797 → 68798 → 68799

Parity: even

Prime: No

Previous Prime: 68791

Next Prime: 68813

Digit Sum: 38

Digital Root: 2

Palindrome: No

Factorization: 2 × 41 × 839

Divisors: 1, 2, 41, 82, 839, 1678, 34399, 68798

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: 10000110010111110

Octal: 206276

Duodecimal: 33992

Hexadecimal: 10cbe

Square: 4733164804

Square Root: 262.29372848011445

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

T(n,k)=Half the number of (n+1)X(n+1) symmetric 0..k arrays with no 2X2 subblock summing to 2k. A213697

a(n) = n³ - 3·n. A121670

Number of peaks at even level in all Dyck paths of semilength n with no UUU's and no DDD's, (U=(1,1), D=(1,-1)). These Dyck paths are counted by the secondary structure numbers (A004148). A166294

Pisot sequence P(7,11), a(0)=7, a(1)=11, a(n+1) is the nearest integer to a(n)²/a(n-1). Agrees with A021014 only for n <= 20. A21013

Half the number of (n+1)X(n+1) symmetric 0..1 arrays with no 2X2 subblock summing to 2. A213690

Half the number of 7X7 0..n symmetric arrays with no 2X2 subblock summing to 2n. A213702

Total number of smallest parts that are also emergent parts in all partitions of n with at least one distinct part: a(n) = n + d(n) + p(n-1) + spt(n) - A000070(n) - σ(n) - 1. A220483

Numbers k such that (68·10^k - 11)/3 is prime. A293399

Integers n such that n = A067030(j) for some j and A067286(j) < A067034(j). A68798