5995
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 28
- Digital Root
- 1
- Palindromic Number
- yes
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 7920
- Proper Divisor Sum (Aliquot Sum)
- 1925
- 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
- 4320
- Möbius Function
- -1
- Radical
- 5995
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- yes
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- yes
- 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
- 80
- 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
- no
- Odd
- yes
Appears in sequences
- Palindromic triangular numbers.at n=10A003098
- a(n) = (2*n+1)*(4*n+1).at n=27A014634
- Pseudoprimes to base 21.at n=18A020149
- Pseudoprimes to base 34.at n=42A020162
- a(n) = 2^n - n^3.at n=13A024013
- a(n) = least m such that if r and s in {1/2, 1/4, 1/6, ..., 1/(2*n)} satisfy r < s, then r < k/m < (k+3)/m < s for some integer k.at n=28A024845
- For n odd, >1, not divisible by 3, we can write 3/n = 1/a + 1/b + 1/c with a>b>c>0, a,b,c distinct and odd; sequence gives smallest a.at n=35A027442
- For n != 1 mod 3, we can write 3/(2n+1) = 1/a + 1/b + 1/c with a>b>c>0, a,b,c distinct and odd; sequence gives smallest such a, or 1 if n = 1 mod 3.at n=53A027443
- a(n) = (prime(n)-3)*(prime(n)-5)/8.at n=46A030007
- Multiplicity of highest weight (or singular) vectors associated with character chi_124 of Monster module.at n=42A034512
- Triangular numbers (A000217) with prime indices.at n=28A034953
- Odd triangular numbers with prime indices.at n=13A034954
- Number of primes < n^3.at n=38A038098
- Palindromic Fibonacci-lucky numbers.at n=38A039674
- Numbers that are palindromic and divisible by 5.at n=22A043040
- Largest palindromic substring in 6^n.at n=18A046264
- Palindromes with exactly 3 prime factors (counted with multiplicity).at n=41A046329
- Palindromes with exactly 3 distinct prime factors.at n=26A046393
- Palindromes expressible as sum of 2 consecutive palindromes.at n=46A046497
- Number of nonempty subsets of {1,2,...,n} in which exactly 1/4 of the elements are <= n/3.at n=15A047196