4088
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 8880
- Proper Divisor Sum (Aliquot Sum)
- 4792
- 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
- 1728
- Möbius Function
- 0
- Radical
- 1022
- Omega Function (Ω)
- 5
- 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
- 64
- 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
- a(n) = 2*a(n-1) + 5*a(n-2), a(0) = 0, a(1) = 1.at n=8A002532
- Maximal number of pieces obtained by slicing a torus (or a bagel) with n cuts: (n^3 + 3*n^2 + 8*n)/6 (n > 0).at n=28A003600
- a(n) = ceiling(1000*log_2(n)).at n=16A004267
- Optimal cost of search tree for searching an ordered array of n elements with cost k of probing element k.at n=41A007077
- Dowling numbers: e.g.f.: exp(x + (exp(b*x) - 1)/b) with b=2.at n=6A007405
- Coordination sequence T2 for Zeolite Code DDR.at n=40A008072
- Coordination sequence T8 for Zeolite Code MFS.at n=40A008180
- Positive integers n such that 2^n == 2^11 (mod n).at n=52A015935
- Expansion of Product_{m>=1} (1+q^m)^28.at n=3A022592
- a(n) = prime(n)*prime(n-1) + 1.at n=18A023523
- Number of partitions of n into parts 3k+1 and 3k+2 with at least one part of each type.at n=37A035620
- Gaps of 7 in sequence A038593 (lower terms).at n=17A038653
- Multiples of 8 that are the difference of two positive cubes.at n=37A038850
- Numbers ending with '8' that are the difference of two positive cubes.at n=18A038863
- Numbers having three 7's in base 8.at n=21A043451
- Bessel function |Y_0(n)| is a monotonically decreasing positive sequence.at n=21A046963
- Let Py(n)=A000330(n)=n-th square pyramidal number. Consider all integer triples (i,j,k), j >= k>0, with Py(i)=Py(j)+Py(k), ordered by increasing i; sequence gives k values.at n=45A053721
- a(n) = n^4 - n.at n=8A058895
- Sum of binary numbers with n 1's and one (possibly leading) 0.at n=8A059672
- Multiples of 7 containing only even digits.at n=39A061826