5934
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
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 12672
- Proper Divisor Sum (Aliquot Sum)
- 6738
- 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
- 1848
- Möbius Function
- 1
- Radical
- 5934
- 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
- 142
- 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 permutations of length n by rises.at n=4A001278
- Number of n-bead necklaces with 3 colors.at n=10A001867
- Irregular triangle read by rows: T(n,k) (n>=1, 0 <= k <= floor(n/2)) = number of permutations of 1..n with exactly floor(n/2) - k runs of consecutive pairs up.at n=21A010029
- a(n) = n^2 + (n+1)^2 + (n+2)^2 + (n+3)^2.at n=37A027575
- Number of flat partitions of n: partitions {a_i} with each |a_i - a_{i-1}| <= 1.at n=53A034296
- Number of ways to color vertices of a 10-gon using <= n colors, allowing only rotations.at n=3A054624
- Numbers k such that k^12 == 1 (mod 13^3).at n=32A056086
- Numbers n such that n | 8^n + 7^n + 1.at n=7A057297
- Numbers n such that n | 11^n + 10^n + 9^n + 8^n + 7^n + 6^n + 5^n + 4^n.at n=49A057492
- Numbers k such that phi(k) divides sigma(k+1) - sigma(k).at n=26A072611
- Sum of first n 6-almost primes.at n=17A086052
- Number of necklaces with n beads of 4 colors, no 2 adjacent beads the same color.at n=9A106366
- Number of permutations of length n which avoid the patterns 2134, 2143, 4312.at n=8A116754
- Triangle read by rows: T(n,k) is the number of deco polyominoes of height n and vertical height (i.e., number of rows) k (1 <= k <= n). A deco polyomino is a directed column-convex polyomino in which the height, measured along the diagonal, is attained only in the last column.at n=34A121692
- a(1)=1, a(2)=1. a(n) = the sum of the two largest earlier terms which are both coprime to n.at n=52A122457
- Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k maximal strings of increasing consecutive integers (0<=k<=floor(n/2)).at n=22A136123
- a(n) is the smallest unused number such that the RMS (Root Mean Square) of a(1) through a(n) is an integer.at n=35A141391
- The even composites c such that c=q*g*j*y and q+g=j*y where q,g,j,y are primes.at n=22A167690
- Numbers n with property that n^2 contains "123" as a substring.at n=41A178314
- Number of distinct n X 2 toroidal 0..2 arrays.at n=4A184279