Properties of the Number 67993

Sixty-Seven Thousand Nine Hundred Ninety-Three

Basics

Value: 67992 → 67993 → 67994

Parity: odd

Prime: Yes

Previous Prime: 67987

Next Prime: 68023

Digit Sum: 34

Digital Root: 7

Palindrome: No

Factorization: 67993

Divisors: 1, 67993

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10000100110011001

Octal: 204631

Duodecimal: 33421

Hexadecimal: 10999

Square: 4623048049

Square Root: 260.7546739753671

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 compositions of n with no part divisible by the next or the prior. A328508

Number of parts in all proper many times partitions of n. A327648

Prime number that appears the most often as the n-th prime factor of an integer in a factorization given in ascending order. A194156

a(n) = (n⁶ - 126·n⁵ + 6217·n⁴ - 153066·n³ + 1987786·n² - 13055316·n + 34747236)/36. A121888

Number of (n+2)X(6+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00001011. A260499

Number of (n+2)X(7+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00001011. A260500

T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00001011. A260501

Consider the sequence of ratios min(t(n-1)/t(n), t(n)/t(n-1)), n=2,3,4,..., where the t(n) are the terms of A067992. Let m be the smallest integer such that all fractions 1/n, 2/n, ..., (n-1)/n have appeared when we reach A067992(m); this sequence gives the values of m; set a(n)=0 if some fraction i/n never appears. A67993