8759
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 29
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 9240
- Proper Divisor Sum (Aliquot Sum)
- 481
- 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
- 8280
- Möbius Function
- 1
- Radical
- 8759
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 215
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- 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
- Number of 7's in all partitions of n.at n=37A024791
- Integer part of (Product(n^((1 + log(i))/i^2), {i, 1, n})).at n=41A062482
- a(n) = sum of the first n upper twin primes.at n=30A086168
- Odd numbers n such that there exists a solution to lcm(s,z-s) = n, lcm(t,z-t) = n-2 and 0 < s+t < z < n.at n=30A108157
- Odd terms of A059756.at n=4A111042
- Partial sums of economical numbers A046759.at n=12A172460
- Number of strings of numbers x(i=1..6) in 0..n with sum i*x(i)^3 equal to 6*n^3.at n=38A184723
- Odd nonprimes n such that n+d+1 is prime for all divisors d of n.at n=23A187554
- Total number of parts of multiplicity 5 in all partitions of n.at n=37A222705
- Composite numbers k such that sigma(k + sigma(k)) = 2*sigma(k).at n=19A246858
- Number of (5+2) X (n+2) 0..3 arrays with every consecutive three elements in every row and diagonal having exactly two distinct values, and in every column and antidiagonal not having exactly two distinct values, and new values 0 upwards introduced in row major order.at n=23A252724
- Number of nX4 0..1 arrays with no element unequal to a strict majority of its horizontal, vertical and antidiagonal neighbors, with the exception of exactly two elements, and with new values introduced in order 0 sequentially upwards.at n=4A280176
- Number of nX5 0..1 arrays with no element unequal to a strict majority of its horizontal, vertical and antidiagonal neighbors, with the exception of exactly two elements, and with new values introduced in order 0 sequentially upwards.at n=3A280177
- T(n,k)=Number of nXk 0..1 arrays with no element unequal to a strict majority of its horizontal, vertical and antidiagonal neighbors, with the exception of exactly two elements, and with new values introduced in order 0 sequentially upwards.at n=31A280180
- T(n,k)=Number of nXk 0..1 arrays with no element unequal to a strict majority of its horizontal, vertical and antidiagonal neighbors, with the exception of exactly two elements, and with new values introduced in order 0 sequentially upwards.at n=32A280180
- a(n) is the number of canonical polygons with 2n edges having 2-fold rotational symmetry.at n=7A307454
- a(n) = Sum_{k=1..n} k^2 * floor(n/k)^3.at n=14A350124