6983
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 6984
- Proper Divisor Sum (Aliquot Sum)
- 1
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6982
- Möbius Function
- -1
- Radical
- 6983
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 88
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- yes
- Safe Prime
- yes
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 898
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes p == 7, 19, 23 (mod 40) such that (p-1)/2 is also prime.at n=44A000353
- Numbers k such that the continued fraction for sqrt(k) has period 64.at n=36A020403
- Primes that remain prime through 2 iterations of the function f(x) = 5x + 4.at n=44A023253
- Primes that remain prime through 3 iterations of function f(x) = 4x + 9.at n=22A023282
- Primes that remain prime through 3 iterations of function f(x) = 5x + 4.at n=15A023284
- Primes that remain prime through 4 iterations of function f(x) = 5x + 4.at n=5A023314
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 83.at n=10A031581
- Primes of form x^2 + 94*y^2.at n=46A033204
- Position reached by frog in A038029. A038026(A038029(n)).at n=38A038031
- Primes of the form k^2 + k + 11.at n=42A048059
- Primes p such that number of primes produced according to rules stipulated in Honaker's A048853 is 1.at n=0A050663
- a(n) is the smallest prime such that the number of primes produced according to rules stipulated in Honaker's A048853 is n.at n=0A050673
- Safe primes which are also Sophie Germain primes.at n=24A059455
- Primes p such that p^11 reversed is also prime.at n=30A059704
- Geometric mean of the digits = 6. In other words, the product of the digits is = 6^k where k is the number of digits.at n=44A061429
- Numbers k such that prime(k+2)-(k+2)*tau(k+2) = prime(k-2)-(k-2)*tau(k-2) where tau(k) = A000005(k) is the number of divisors of k.at n=23A067354
- a(n) = the n-th prime with sum of decimal digits = n, or 0 if no such number exists.at n=25A075361
- Prime numbers using only the curved digits 0, 3, 6, 8 and 9.at n=28A079652
- Smallest primes such that a(j) - a(k) are all different.at n=40A079848
- a(1) = 1 and then the smallest primes such that all a(k)-a(j) are distinct composite numbers.at n=37A079850