5694
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 12432
- 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
- 1728
- Möbius Function
- 1
- Radical
- 5694
- 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
- 173
- 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
- a(n) = Sum_{i=1..floor((n+1)/4)} a(2*i-1) * a(n-2*i+1), with a(1)=3, a(2)=1, and a(3)=2.at n=9A024743
- Expansion of 1/((1-2x)(1-5x)(1-7x)(1-11x)).at n=3A025995
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 50.at n=23A031548
- Numbers each of whose runs of digits in base 12 has length 2.at n=38A033010
- a(n) = prime(n)*prime(n+1) - prime(n).at n=20A037166
- Numerators of continued fraction convergents to sqrt(344).at n=8A041650
- Numbers k such that sopf(k) = sopf(k+2), where sopf(k) = A008472(k).at n=6A063968
- Indices of primes in sequence defined by A(0) = 89, A(n) = 10*A(n-1) - 41 for n > 0.at n=8A101069
- Multiples of 13 whose reversal + 1 is also a multiple of 13.at n=28A166390
- T(n,k)=number of nXk binary matrices with floor((n*k)/2) 1's and rows and columns in lexicographically nondecreasing order.at n=48A180979
- T(n,k)=number of nXk binary matrices with floor((n*k)/2) 1's and rows and columns in lexicographically nondecreasing order.at n=51A180979
- Number of nX4 0..1 arrays with rows and columns lexicographically nondecreasing and the instance counts of every value within one of each other.at n=6A201380
- Number of nX7 0..1 arrays with rows and columns lexicographically nondecreasing and the instance counts of every value within one of each other.at n=3A201383
- T(n,k)=Number of nXk 0..1 arrays with rows and columns lexicographically nondecreasing and the instance counts of every value within one of each other.at n=48A201384
- T(n,k)=Number of nXk 0..1 arrays with rows and columns lexicographically nondecreasing and the instance counts of every value within one of each other.at n=51A201384
- Number of (w,x,y,z) with all terms in {1,...,n} and |w-x|=w+|y-z|.at n=26A212685
- Sum of the squared parts of the partitions of n into exactly two parts.at n=25A226141
- Numbers k such that 1 + k + k^3 + k^5 + k^7 + k^9 + ... + k^33 is prime.at n=40A244384
- Numbers k such that the smallest prime divisor of k^2+1 is 53.at n=37A248532
- Number of (n+1) X (6+1) 0..1 arrays with each 2 X 2 subblock having clockwise pattern 0000 0011 or 0101.at n=8A259220