Properties of the Number 68022

Sixty-Eight Thousand Twenty-Two

Basics

Value: 68021 → 68022 → 68023

Parity: even

Prime: No

Previous Prime: 67993

Next Prime: 68023

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ² × 3779

Divisors: 1, 2, 3, 6, 9, 18, 3779, 7558, 11337, 22674

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10000100110110110

Octal: 204666

Duodecimal: 33446

Hexadecimal: 109b6

Square: 4626992484

Square Root: 260.8102758711781

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

Consider the 10's complements mod 10 of the digits of a number k. Take their sum and repeat the process deleting the first addend and adding the previous sum. The sequence lists the numbers that after some iterations reach a sum equal to k. A263534

Triangle read by rows: T(n,k) is the number of secondary structures of size n having k stacks of length 3. A202843

Number of secondary structures of size n having no stacks of length 3. A202844

a(n) = ∑_k=1..n φ(k)*φ(k+1)*φ(k+2), where φ(k) = A000010(k) is Euler's totient function. A335131

a(n) = n-1 for n <= 4, otherwise if n is even then a(n) = a(n-5)+2^n/2, and if n is odd then a(n) = a(n-1)+2^(n-3/2). A200310

Z(S_m; σ[1](n), σ[2](n),..., σ[m](n)) where Z(S_m; x₁,x₂,...,x_m) is the cycle index of the symmetric group S_m and σ[k](n) is the sum of k-th powers of divisors of n; m=5. A68022

Solution to the problem of finding the number of comparisons needed for optimal merging of 3 elements with n elements. A239100