8757
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 14560
- Proper Divisor Sum (Aliquot Sum)
- 5803
- 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
- 4968
- Möbius Function
- 0
- Radical
- 2919
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 3
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
- 34
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Lucky numbers with smallest increasing gaps (upper terms).at n=18A031885
- 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=45A046258
- Numbers n such that 105*2^n-1 is prime.at n=30A050578
- Number of integers q such that phiter(q)=n where phiter(n) = A064415(n).at n=11A064416
- Numbers k such that 2^k - 13 is prime.at n=12A096818
- Records in A119451.at n=22A119452
- Triangle where g.f. of row n = Product_{i=0..n} [F(i+1) + F(i)*x] for n>=0, where F(i) = A000045(i) is the i-th Fibonacci number.at n=25A130405
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, 0), (0, 1, -1), (1, 0, 1)}.at n=9A148771
- Number of ways to select disjoint subsets out of {1..n} such that their (sorted) element sums give the list of divisors of n.at n=45A164988
- Numbers k for which 5*k-4, 5*k-2, 5*k+2, and 5*k+4 are primes.at n=23A178082
- Expansion of x*(1+2*x+8*x^2+4*x^3+3*x^4) / ( (1+x)^2*(x-1)^4 ).at n=22A178947
- Numbers n such that n!10 + 2 is prime.at n=40A204657
- The largest n-digit number whose first k digits are divisible by the k-th prime for k = 1..n.at n=3A225613
- The decimal values of binary sequences representing the "bits" form of adjacency matrices of non-isomorphic tournament graphs.at n=25A256373
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 517", based on the 5-celled von Neumann neighborhood.at n=20A272732
- Expansion of Product_{k>=1} 1/(1+x^k)^(k^2) in powers of x.at n=16A284896
- Self numbers that are the product of two self numbers greater than one.at n=48A290574
- a(n) is the least integer k such that k/Fibonacci(n) > 4/5.at n=21A293672
- a(n) is the integer k that minimizes |k/Fibonacci(n) - 4/5|.at n=21A293673
- Number of ways to write n as an ordered sum of 7 primes.at n=23A340963