5695
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 7344
- Proper Divisor Sum (Aliquot Sum)
- 1649
- 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
- 4224
- Möbius Function
- -1
- Radical
- 5695
- 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
- 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
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = floor(n*(n-1)*(n-2)/13).at n=43A011895
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly nine 1's.at n=16A020445
- Numbers having three 7's in base 9.at n=16A043483
- a(n)=Sum{T(n,j): j=1,2,...,n}, array T given by A048212.at n=19A048222
- Recip transform of 2*(1 + x^2 + x^5 + x^6)-1/(1-x).at n=11A049167
- McKay-Thompson series of class 19A for Monster.at n=18A058549
- Numbers n such that sum of primes dividing n (with repetition) is equal to the largest prime factor of n+1.at n=13A071863
- CONTINUANT transform of Fibonacci number 1, 2, 3, 5, 8, ...at n=5A071895
- Number of primes between 3^n and 4^n.at n=7A076959
- a(n) = the smallest positive number which furnishes a "one-line proof" for primality of prime(n), the n-th prime; i.e., the smallest k which is relatively prime to p such that k*(p+k) is divisible by every prime less than sqrt(p), where p=prime(n).at n=63A079900
- Numbers n such that 8*10^n + 4*R_n + 5 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=9A103082
- a(n) = F(n)*a(n-1) + a(n-2) with a(0) = 0, a(1) = 1.at n=7A135829
- McKay-Thompson series of class 19A for the Monster group with a(0) = 3.at n=18A136569
- Number of ways to place zero or more nonadjacent 0,0 1,0 2,1 2,2 3,0 3,1 polyhexes in any orientation on a planar nXnXn triangular grid.at n=6A155303
- Numbers n such that 2^x + 3^y is never prime when max(x,y) = n.at n=6A159625
- a(n) = (2*n^3 + 5*n^2 + 7*n)/2.at n=16A162264
- Integers of the form 4n+3 for which Sum_{i=1..u} J(i,4n+3) obtains value zero exactly 3 times, when u ranges from 1 to (4n+3). Here J(i,k) is the Jacobi symbol.at n=21A166053
- a(n) = 20*a(n-1) - 64*a(n-2) - 45 for n>1; a(0) = 399, a(1) = 5695.at n=1A166915
- Floor(sqrt(n))-perfect numbers.at n=47A176234
- Magic constants of 5 X 5 magic squares which consist of consecutive primes.at n=23A176571