5809
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 6004
- Proper Divisor Sum (Aliquot Sum)
- 195
- 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
- 5616
- Möbius Function
- 1
- Radical
- 5809
- 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
- 49
- 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
- Sequence satisfies T^2(a)=a, where T is defined below.at n=53A027591
- Number of T-frame polyominoes with n cells.at n=44A028247
- "CFJ" (necklace, size, labeled) transform of 2,1,1,1...at n=9A032135
- Numbers k such that 65*2^k+1 is prime.at n=31A032382
- a(n) = n * prime(n).at n=36A033286
- Number of partitions of n such that cn(3,5) <= cn(0,5) = cn(1,5) <= cn(2,5) = cn(4,5).at n=68A036865
- Denominators of continued fraction convergents to sqrt(299).at n=6A041563
- a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 3, where m = 2^(p+1) + 2 - n and p is the smallest number such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = 2.at n=12A049961
- Third spoke of a hexagonal spiral.at n=44A056107
- Number of numbers whose cube root rounds to n.at n=44A058034
- Numbers k such that sopf(k) = 2*sopf(k+1), where sopf(k) = A008472.at n=9A064112
- Semiprimes p1*p2 such that p2 mod p1 = 9, with p2 > p1.at n=28A064907
- a(n) = (11*n^2 - 11*n + 2)/2.at n=32A069125
- a(n) = prime(n) * prime(prime(n)).at n=11A073065
- Leading diagonal of A083173.at n=36A083174
- Number of interior intersection points made by the straight line segments connecting the edges of an equilateral triangle with the n-1 points resulting from a subdivision of the sides into n equal pieces, counting coinciding intersection points only once.at n=45A091908
- Index of the first occurrence of prime(n) in A092938.at n=45A092939
- Triangle read by rows: T(n,k) = number of peakless Motzkin paths of length n and containing a total of k level steps H in all DHH...HU's, where U=(1,1), H=(1,0) and D=(1,-1) (can be easily expressed using RNA secondary structure terminology).at n=52A097107
- Unicode codes for the lunation runes, used in certain medieval Scandinavian perpetual calendar staves as golden numbers 1-19.at n=4A098476
- a(n) is the numerator of 1 - Sum_{i=1..n} Bernoulli(i).at n=14A100649