5698
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 28
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 10944
- Proper Divisor Sum (Aliquot Sum)
- 5246
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2160
- Möbius Function
- 1
- Radical
- 5698
- 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
- 67
- 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
- Expansion of 1/((1-x)^2*(1-x^2)*(1-x^5)*(1-x^10)*(1-x^20)).at n=49A001305
- Number of coprime chains with largest member prime(n).at n=24A003140
- Number of planted identity trees where non-root, non-leaf nodes an even distance from root are of degree 2.at n=19A007560
- Expansion of e.g.f. cos(log(1+tan(x))).at n=7A009021
- Multiplicity of highest weight (or singular) vectors associated with character chi_155 of Monster module.at n=38A034543
- Number of partitions in parts not of the form 13k, 13k+3 or 13k-3. Also number of partitions with at most 2 parts of size 1 and differences between parts at distance 5 are greater than 1.at n=35A035951
- 17-gonal (or heptadecagonal) numbers: a(n) = n*(15*n-13)/2.at n=28A051869
- Coordination sequence T2 for Zeolite Code MTF.at n=45A057305
- Numbers k such that k^512 + 1 is prime.at n=16A057465
- Numbers n such that phi(n) = product of the digits of n.at n=10A058627
- Engel expansion of 1/e = 0.367879... .at n=37A059193
- Number of primes between n^4 and (n+1)^4.at n=26A061235
- Nonprimes k such that k divides prime(k)^2 - 1.at n=48A064938
- Numbers k such that average of prime(k) and prime(k+1) is a perfect square.at n=33A076692
- Number of parts unequal to 1 in all partitions of the integer n. Also the difference between the labeled and the unlabeled case of one-element transitions from the partitions of n to the partitions of n+1.at n=23A096541
- 4-almost primes equal to the product of two successive semiprimes.at n=24A108215
- Row 7 of array in A105272.at n=60A121514
- a(n) = -1 + Sum_{i=1..n} Sum_{j=1..n} i^j.at n=4A124403
- Array read by antidiagonals, giving the sizes pi_l(c_l(m,n)) of minimal covers (see reference for precise definition).at n=48A133713
- Column 3 of array in A133713.at n=6A133718