8909
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
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 9120
- Proper Divisor Sum (Aliquot Sum)
- 211
- 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
- 8700
- Möbius Function
- 1
- Radical
- 8909
- 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
- 140
- 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
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite EUO = EU-1 Nan[AlnSi112-nO224] starting with a T10 atom.at n=12A019129
- Numbers k such that 279*2^k + 1 is prime.at n=18A053356
- a(n) = (prime(n)+1)*n - 1.at n=44A083723
- a(n) = floor(7^n/6^n).at n=59A094988
- k such that k-th prime is of the form 2n^2 + 3n + 3.at n=32A096690
- Maximal number of squares of side 1 in an ellipse of semiaxes n,2n.at n=37A108126
- Sum of third powers of five consecutive primes.at n=2A133539
- a(n) = (2*n + 1)*(5*n + 6).at n=29A153127
- Inverse permutation to A190128.at n=23A190129
- Inverse permutation to A190134.at n=11A190135
- Number of -2..2 arrays x(i) of n+1 elements i=1..n+1 with set{t,u,v in 0,1}((x[i+t]+x[j+u]+x[k+v])*(-1)^(t+u+v)) having one, three, four, five, six or eight distinct values for every i,j,k<=n.at n=6A211593
- Least k > 1 such that tri(n)+ ... + tri(n+k-1) is a triangular number.at n=55A214697
- Number of partitions of n such that (greatest part) + (least part) < number of parts.at n=36A237822
- Number of 3-element subsets of {1,...,n} whose sum has more than 4 divisors.at n=49A241565
- Number of hypoplactic classes of 3-parking functions of length n.at n=5A243675
- Centered octahemioctahedral numbers: a(n) = (4*n^3+24*n^2+8*n+3)/3.at n=17A274974
- Number of nXn 0..1 arrays with every element unequal to 0, 1 or 2 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=9A317758
- Sum of the fifth largest parts of the partitions of n into 10 parts.at n=39A326594
- Numbers whose arithmetic derivative (A003415) is a primorial number (A002110) > 1.at n=14A327978
- a(n) = Sum_{j=1..n} A003718(j-1)*prime(j).at n=26A342604