Properties of the Number 68830

Sixty-Eight Thousand Eight Hundred Thirty

Basics

Value: 68829 → 68830 → 68831

Parity: even

Prime: No

Previous Prime: 68821

Next Prime: 68863

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 × 5 × 6883

Divisors: 1, 2, 5, 10, 6883, 13766, 34415, 68830

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10000110011011110

Octal: 206336

Duodecimal: 339BA

Hexadecimal: 10cde

Square: 4737568900

Square Root: 262.35472170326955

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)=Number of (n+1)X(k+1) 0..2 arrays with the upper median plus the lower median minus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one. A237868

Number of (n+1)X(2+1) 0..2 arrays with the upper median plus the lower median minus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one. A237862

Number of (n+1)X(4+1) 0..2 arrays with the upper median plus the lower median minus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one. A237864

Number of nX4 0..3 arrays with no element equal to zero plus the sum of elements to its left or zero plus the sum of elements above it or one plus the sum of the elements diagonally to its northwest or one plus the sum of the elements antidiagonally to its northeast, modulo 4. A239854

Let sequence B_n={b_m} be defined by: b₁=prime(n), b₂=prime(n+1); for m>=3, b_m=b_m-2+b_m-1 if b_m-2+b_m-1 is not semiprime, otherwise b_m is the least prime divisor of b_m-2+b_m-1. Then a(n) is the maximal term of sequence B_n, or a(n)=0 if B_n is unbounded. A221218

T(n,k)=Number of nXk 0..3 arrays with no element equal to zero plus the sum of elements to its left or zero plus the sum of the elements above it or one plus the sum of the elements diagonally to its northwest or one plus the sum of the elements antidiagonally to its northeast, modulo 4. A239858

Smallest member of the first occurrence of exactly n consecutive primes with all odd digits. A68830