8904
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 25920
- Proper Divisor Sum (Aliquot Sum)
- 17016
- 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
- 2496
- Möbius Function
- 0
- Radical
- 2226
- Omega Function (Ω)
- 6
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 140
- 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
- yes
- Odd
- no
Appears in sequences
- Tribonacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3) with a(0)=0, a(1)=1, a(2)=0.at n=18A001590
- Fibonacci sequence beginning 1, 23.at n=14A022393
- Number of labeled servers of dimension 4.at n=5A027391
- Numbers k such that 241*2^k+1 is prime.at n=4A032497
- Consider the sequence of 4-tuples {0,a,b,c} (c>=a+b; a,b,c>0) which have the smallest integer 'c' required to reach {k,k,k,k} in n steps under map {r,s,t,u}->{|r-s|,|s-t|,|t-u|,|u-r|}. This sequence gives the second term 'a' of these quadruples.at n=28A034803
- Consider the sequence of 4-tuples {0,a,b,c} (c>=a+b; a,b,c>0) which have the smallest integer 'c' required to reach {k,k,k,k} in n steps under map {r,s,t,u}->{|r-s|,|s-t|,|t-u|,|u-r|}. This sequence gives the third term 'b' of these quadruples.at n=26A034804
- Numbers k such that 43^k - 42 is prime.at n=8A034923
- Numbers k such that k-th and (k+1)-st term of A038593 differ by 6.at n=41A038637
- a(n) = Sum_{k=0..n} T(n, k), array T as in A047080.at n=15A047081
- Let Do(n)=A006566(n)=n-th dodecahedral number. Consider all integer triples (i,j,k), j >= k>0, with Do(i)=Do(j)+Do(k), ordered by increasing i; sequence gives j values.at n=5A053018
- Low-temperature susceptibility expansion for Kagome net (Potts model, q=3).at n=7A057399
- Numbers k such that phi(x) = k has exactly 12 solutions.at n=30A060675
- Numbers k such that k-th prime = sigma(sigma(k)) + 1.at n=3A074240
- Smallest multiple of n beginning with the n-th prime.at n=23A078208
- Partial sums of A087100.at n=23A087098
- Expansion of -x^2*(x^9-x^8+2*x^7-x^6+x^5-2*x^4+x^2+1) / ((x^6-x^4+x^2+1) * (x^6+x^4+x^2-1)).at n=37A114952
- a(n) = (1/6)*(n^6+3*n^4+12*n^3+8*n^2).at n=6A115286
- Numbers k such that k*(k+3) gives the concatenation of two numbers m and m-2.at n=7A116274
- Number of subpartitions of partition P=[0,0,0,0,1,1,1,1,1,2,2,2,2,2,2,3,...], where P(n) = [(sqrt(8*n+49) - 7)/2].at n=27A121433
- 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, 0, 0), (0, -1, 0), (0, 0, 1), (1, 1, -1), (1, 1, 0)}.at n=7A150599