8934
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
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 17880
- Proper Divisor Sum (Aliquot Sum)
- 8946
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 2976
- Möbius Function
- -1
- Radical
- 8934
- Omega Function (Ω)
- 3
- 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
- 140
- Smith Number
- no
- 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
- Numbers k such that prime(k+3)-(k+3)*tau(k+3) = prime(k-3)-(k-3)*tau(k-3) where tau(k) = A000005(k) is the number of divisors of k.at n=23A067355
- Indices of primes in sequence defined by A(0) = 19, A(n) = 10*A(n-1) - 11 for n > 0.at n=9A102028
- a(n) = floor(sqrt(2*n!)).at n=11A129960
- a(n) = Sum {j=1..n} j*A001462(j).at n=42A143125
- 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, 1), (0, 1, -1), (1, 0, 0)}.at n=11A148071
- Riordan matrix (1/((1-x)*sqrt(1-4*x)),x/(1-x)).at n=47A187887
- Riordan matrix (1/sqrt(1-4*x),x/(1-x)).at n=58A187888
- The generalized Conway-Guy sequence w^{4}.at n=15A195683
- Number of ordered triples (w,x,y) with all terms in {-n,...-1,1,...,n} and -1<=w+x+y<=1.at n=32A211615
- The hyper-Wiener index of the nanostar dendrimer G[n], defined pictorially in the Nadjafi-Arani et al. reference.at n=1A221011
- T(n,k) = Number of length n+3 0..k arrays with no four consecutive terms having the sum of any three elements equal to three times the fourth.at n=36A249290
- Number of length 1+3 0..n arrays with no four consecutive terms having the sum of any three elements equal to three times the fourth.at n=8A249291
- O.g.f.: exp( Sum_{n>=1} A256357(n^2)*x^n/n ), where exp( Sum_{n>=1} A256357(n)*x^n/n ) = 1 + Sum_{n>=1} x^(n^2) + x^(2*n^2).at n=24A258656
- a(n) = number of steps to reach 0 when starting from k = n^3 and repeatedly applying the map that replaces k with k - A055401(k), where A055401(k) = the number of positive cubes needed to sum to k using the greedy algorithm.at n=42A261227
- a(n) = n^3/3 - 7*n/3 + 4.at n=30A270809
- The number of partitions of [n] with exactly 4 blocks without peaks.at n=10A289694
- Number of 5-cycles in the n-triangular honeycomb obtuse knight graph.at n=20A290391
- Number of integer partitions of n for which the parts have the same median as the multiplicities.at n=41A360456