7883
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
- 4
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 7884
- 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
- 7882
- Möbius Function
- -1
- Radical
- 7883
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 83
- 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
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 997
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- 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 87.at n=29A031585
- Lower prime of a difference of 18 between consecutive primes.at n=33A031936
- Primes that are concatenations of n with n + 5.at n=7A032628
- Discriminants of imaginary quadratic fields with class number 17 (negated).at n=19A046014
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 2 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 2, and a(3) = 1.at n=30A050043
- Primes arising in A053782.at n=20A053872
- Primes with either no internal digits or all internal digits are 8.at n=45A069683
- Primes p such that 3p is equidistant from consecutive prime twin pairs.at n=43A074931
- Primes for which the four closest primes are smaller.at n=15A075030
- Class 5+ primes (for definition see A005105).at n=38A081633
- Primes whose reversal is a multiple of 23.at n=39A087767
- a(n) = F(n+1)*a(n-1) + F(n)*a(n-2), where F = A000045 (Fibonacci numbers), a(0)=1, a(1)=1.at n=6A096655
- Primes of the form a^5 + b^3 with a,b>0.at n=14A100273
- a(0)=3; for n > 0, a(n) = smallest prime > a(n-1) such that Product_{i=0..n} a(i) - 2 is prime.at n=49A100276
- Primes from merging of 4 successive digits in decimal expansion of the Golden Ratio, (1+sqrt(5))/2.at n=36A103810
- Primes with digit sum = 26.at n=33A106764
- Smaller of two consecutive prime numbers with the same digital root.at n=33A117838
- a(1)=8; a(n)=floor((41+sum(a(1) to a(n-1)))/5).at n=38A120176
- Primes with prime "Look And Say" descriptions from right to left (irrespective of method A or method B).at n=20A127179
- Prime numbers n such that A127350(k) = 2*n for some k.at n=1A127351