8663
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 8664
- 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
- 8662
- Möbius Function
- -1
- Radical
- 8663
- 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
- 127
- 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
- 1078
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Expansion of 1/(1-x^5-x^6-x^7-x^8).at n=50A017839
- a(n) = floor( exp(13/24)*n! ).at n=6A030802
- 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 93.at n=1A031591
- Upper prime of a difference of 16 between consecutive primes.at n=28A031935
- Number of partitions of n with equal nonzero number of parts congruent to each of 0, 1 and 4 (mod 5).at n=57A035584
- a(1) = 8; a(n) is smallest number >= a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=44A046258
- Primes p such that x^61 = 2 has no solution mod p.at n=20A059230
- Primes with either no internal digits or all internal digits are 6.at n=48A069681
- Prime numbers using only the curved digits 0, 3, 6, 8 and 9.at n=38A079652
- Beginning with 2 the smallest prime greater than the previous term such that the difference of successive terms is a distinct square.at n=11A084710
- Primes whose successive differences are increasing squares.at n=8A088173
- Primes in which no digit is coprime to its neighbors.at n=23A088297
- Primes of the form 6n^2 - 1.at n=17A090686
- a(n) = ceiling((sqrt n)^(sqrt n)).at n=28A094093
- List of primes produced by a certain "prime-generating" quartic polynomial.at n=16A096372
- Greater of a,b where n^2 = a^3 + b^3; a,b>0 and gcd(a,b)=1. The lesser of a,b is the corresponding term in A099532 and n, which is used to order this sequence, is the corresponding term in A099426.at n=24A099533
- If a,b are prime numbers satisfying the Diophantine equation a^3+b^3=c^2, then a is -1 mod 12 and b is 1 mod 12, or vice versa. Choose 'a' to be -1 mod 12. This is the sequence of 'a' values, sorted by the magnitude of c.at n=1A099806
- Sum of the first n pairs of consecutive primes (for example, a(3) = (2+3) + (3+5) + (5+7) = 25).at n=45A102724
- Smallest prime equal to the sum of n distinct pairs of consecutive primes.at n=45A102725
- Integer part of n#/((p-3)# 3#), where p=preceding prime to n.at n=48A102786