8790
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 21168
- Proper Divisor Sum (Aliquot Sum)
- 12378
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2336
- Möbius Function
- 1
- Radical
- 8790
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- yes
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- yes
- Odd
- no
Appears in sequences
- Antichains (or order ideals) in the poset 2*2*3*n or size of the distributive lattice J(2*2*3*n).at n=3A006360
- Number of rooted planar maps with 4 faces and n vertices and no isthmuses.at n=7A006468
- a(0) = 1, a(n) = 13*n^2 + 2 for n>0.at n=26A010004
- a(n) = 4*n^2 - 9*n + 6.at n=47A054556
- Antichains (or order ideals) in the poset 2*3*3*n or size of the distributive lattice J(2*3*3*n).at n=2A056935
- Number of ways to cover (without overlapping) a ring lattice (necklace) of n sites with molecules that are 9 sites wide.at n=46A058364
- For even n>=4, let f(n)=A066285(n/2) be the minimal difference between primes p and q whose sum is n. This sequence contains the successive maxima of f.at n=54A066286
- Poincaré series [or Poincare series] P(C_{5,2}; x).at n=12A124613
- Numbers k such that the numerator of the Bernoulli number B(2k) ends with the digits 691.at n=31A132184
- 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, -1), (-1, 0, 0), (0, 1, 1), (1, -1, 1), (1, 1, 0)}.at n=7A150571
- Number of n X 4 binary arrays with all 1s connected, a path of 1s from upper left corner to lower right corner, and no 1 having more than two 1s adjacent.at n=7A163687
- Number of n X 8 binary arrays with all 1's connected, a path of 1's from upper left corner to lower right corner, and no 1 having more than two 1's adjacent.at n=3A163691
- Triangle |S_{n,N}| read by rows, the number of permutations of [1..n] that are realized by a shift on N symbols.at n=17A165325
- Integers of the form: 0/3 + 1/3 + 2/3 + 3/3 + 5/3 + 7/3 + 11/3 + 13/3 + 17/3 + ....at n=38A182155
- Triangle read by rows: Number of crossing set partitions of {1,2,...,n} into k blocks.at n=47A189232
- Number of permutations of [n] that require a 3-letter alphabet in order to be realized by a shift.at n=6A192089
- Number of fixed polypons with n cells (division into triangles is significant).at n=12A196993
- Denominators of Bernoulli numbers which are == 6 (mod 9).at n=32A218755
- Number of partitions p = [x(1), ..., x(k)], where x(1) >= x(2) >= ... >= x(k), of n such that max(x(i) - x(i-1)) > number of parts of p.at n=42A241832
- Number of length n+5 0..4 arrays with no six consecutive terms having the maximum of any two terms equal to the minimum of the remaining four terms.at n=0A249956