5106
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 10944
- Proper Divisor Sum (Aliquot Sum)
- 5838
- 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
- 1584
- Möbius Function
- 1
- Radical
- 5106
- 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
- 178
- 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
- Number of primes < prime(n)^2.at n=47A000879
- High temperature series for spin-1/2 Ising surface susceptibility on 3-dimensional simple cubic lattice.at n=4A003490
- Coordination sequence for FeS2-Marcasite, Fe position.at n=35A009955
- a(n)=a(n-1)+a(n-4).at n=26A014098
- Expansion of 1/(1-x^6-x^7-x^8-x^9-x^10-x^11-x^12-x^13-x^14-x^15-x^16).at n=44A017856
- a(n) = a(1)*a(n-1) + a(2)*a(n-2) + ...+ a(n-1)*a(1) for n >= 5, with initial values 1,-1,1,1.at n=21A025278
- Graham-Sloane-type lower bound on the size of a ternary (n,3,4) constant-weight code.at n=23A030504
- Number of partitions of n into a prime number of parts.at n=35A038499
- T(n,n-2), array T as in A047100.at n=7A047104
- Iterated procedure 'composite k added to sum of its prime factors reaches a prime' yields 6 skipped primes.at n=30A050773
- Number of n-bead necklaces with exactly four different colored beads.at n=7A056284
- Let R(i,j) be the rectangle with antidiagonals 1; 2,3; 4,5,6; ...; each k is an R(i(k),j(k)) and A057047(n)=j(2^n).at n=24A057047
- Maximal number of 132 patterns in a permutation of 1,2,...,n.at n=40A061061
- Nonprimes k such that k divides prime(k)^2 - 1.at n=47A064938
- Integers k such that k*28*c + 1 is prime for c = 1, 2, 4, 7 and 14.at n=3A067199
- a(n) = {A081982(n)+1}/d, where d is the product of nonzero digits of A081982(n).at n=51A081987
- Quotient of LCM of prime(n+1)-1 and prime(n)-1 and GCD of the same two numbers.at n=33A083555
- Number of lattice points on or inside the rectangle formed by [1 <= x <= (q-1)/2] and [1 <= y <= (p-1)/2], where p = n-th prime, q = (n-1)-st prime.at n=32A087427
- Triangle read by rows: T(n,k) is the number of n-bead necklaces with exactly k different colored beads.at n=31A087854
- Sums of squares of primitive roots of primes.at n=11A089453