5334
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 12288
- Proper Divisor Sum (Aliquot Sum)
- 6954
- 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
- 1512
- Möbius Function
- 1
- Radical
- 5334
- 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
- 46
- 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 k divides 2^(k+1) - 2.at n=25A014741
- Positive integers n such that n | (2^n + n/2 - 1).at n=23A015942
- Convolution of natural numbers >= 2 and natural numbers >= 3.at n=27A023545
- a(n) = n^2 + (n+1)^2 + (n+2)^2 + (n+3)^2.at n=35A027575
- Maximal number of pairs of minimal vectors in n-dimensional laminated lattice.at n=19A028924
- Number of partitions of n with equal nonzero number of parts congruent to each of 0, 2 and 4 (mod 5).at n=50A035586
- Numbers k such that k-th and (k+1)-st term of A038593 differ by 6.at n=29A038637
- Number of partitions satisfying cn(2,5) + cn(3,5) <= cn(1,5) and cn(2,5) + cn(3,5) <= cn(4,5).at n=38A039877
- Twice second pentagonal numbers.at n=42A049451
- a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = n - 1 - 2^p and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = a(3) = 3.at n=13A049926
- a(n) = p(7n+5)/7 where p(k) denotes the k-th partition number.at n=5A071746
- Central coefficients of Moebius polynomials (A074586): coefficient of x^(n/2-1/2) if n is odd; coefficient of x^(n/2-1) if n is even and >4. The n-th Moebius polynomial, M(n,x), satisfies M(n,-1)=mu(n) the Moebius function of n.at n=13A077596
- a(1)=1, a(2)=2 and a(n+1) is minimal such that there are a(n-1) primes strictly between a(n) and a(n+1).at n=9A082279
- a(n) = smallest k such that (10^k-1)/9 == 0 mod prime(n)^2, or 0 if no such k exists.at n=30A087094
- a(n) = C(2n-1,n-1) mod n^3.at n=32A099907
- Triangle read by rows: T(n,h) = number of functions f:{1,2,...,n}->{1,2,...,n-1} such that |Image(f)|=h, h=1,2,...,n-1, n=2,3,...at n=22A101819
- Remove the least number of commas from A093086 and concatenate digits so as to always have a(n) < a(n+1).at n=7A102085
- Triangle read by rows: T(n,k) = number of peakless Motzkin paths of length n and having k ascents (0<=k<=floor(n/3)).at n=43A114712
- Terms of A068563 that are not terms of A124240.at n=24A124241
- Numbers n such that A117731(n) differs from A082687(n).at n=37A125740