5609
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 5760
- Proper Divisor Sum (Aliquot Sum)
- 151
- 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
- 5460
- Möbius Function
- 1
- Radical
- 5609
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 111
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = (10n+1)*(10n+9).at n=7A001535
- a(n) is the number of partitions of 3n that can be obtained by adding together three (not necessarily distinct) partitions of n.at n=10A002220
- Expansion of (1+x^2)/(1 - 2*x - 2*x^2 + x^3).at n=9A014742
- Numbers k such that the continued fraction for sqrt(k) has period 62.at n=20A020401
- a(n) = Sum_{k=0..floor(n/2)} A026637(n-k, k).at n=18A026647
- Cube root of A030690.at n=41A030691
- a(n) = n-th prime number * n-th lucky number.at n=19A032601
- Numbers whose set of base-7 digits is {2,3}.at n=32A032807
- Multiplicity of highest weight (or singular) vectors associated with character chi_34 of Monster module.at n=40A034422
- Numerators of continued fraction convergents to sqrt(662).at n=8A042272
- Numbers whose base-7 representation contains exactly four 2's.at n=14A043404
- Numbers whose base-5 representation contains exactly two 1's and three 4's.at n=32A045258
- n-th 6k+1 prime times n-th 6k-1 prime.at n=9A048629
- a(n) = ceiling(binomial(n,6)/n).at n=23A053643
- One less than six times product of first n primes of form 6k-1.at n=2A057131
- Semiprimes p1*p2 such that p2 > p1 and p2 mod p1 = 8.at n=30A064906
- Reverse of smallest prime factor of k = largest prime factor of k+1; a(1)=1.at n=7A071392
- Numbers n such that the sum of composites from the smallest prime factor of n to the largest prime factor of n is equal to the sum of squarefree numbers from the smallest prime factor of n to the largest prime factor of n.at n=3A074255
- Numbers k such that prime(k) + prime(k+1) + prime(k+2) is a square.at n=15A076305
- Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=2, r=3, I={-1,0}.at n=21A080008