5697
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 8480
- Proper Divisor Sum (Aliquot Sum)
- 2783
- 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
- 3780
- Möbius Function
- 0
- Radical
- 633
- Omega Function (Ω)
- 4
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 67
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- Numbers k such that 2*10^k - 1 is prime.at n=20A002957
- Oscillates under partition transform.at n=53A007212
- Sequence satisfies T^2(a)=a, where T is defined below.at n=53A027595
- Cube root of A030690.at n=42A030691
- a(n) = Sum_{i=0..2n} (-1)^i * T(i,2n-i), array T as in A049723.at n=30A049725
- Numbers k such that gcd(k, reverse(k)) = 27 = 3^3, where reverse(x) = A004086(x).at n=7A072016
- Sum of first n 5-almost primes.at n=25A086047
- Smallest number which requires n iterations to reach a prime when iterating x + sum of squares of digits of x.at n=34A094658
- Numerator of Sum_{k=0..n} 1/binomial(n,k)^2.at n=8A100516
- T(n,m) is the smallest number that starts a sequence of n+1 consecutive integers whose Euler totient Functions are multiples of m.at n=59A128252
- a(n) is the smallest m such that m^3 begins with n^2.at n=42A138173
- a(n) = n*(8*n-5).at n=27A139272
- a(n) = Sum_{k=0..[n/2]} C(n-k,k)^(n-k)*n/(n-k), n>=1.at n=5A166895
- Expand 1/(1 - (3/2)*x + (2/3)*x^4 - x^5) in powers of x, then multiply coefficient of x^n by 3^floor(n/4)*2^n to get integers.at n=7A202907
- Total number of parts k in all partitions of n such that k does not divide n.at n=22A209313
- Composite numbers which yield a prime whenever a 5 is inserted anywhere in them, excluding at the end.at n=48A216167
- Trajectory of 80 under the map n-> A006368(n).at n=43A223087
- Minimum value unattainable as the sum of 3 attained values of a*b with a,b 0..n integers.at n=45A225257
- Number of n X 2 0..2 arrays with horizontal differences mod 3 never 1, vertical differences mod 3 never -1, rows lexicographically nondecreasing, and columns lexicographically nonincreasing.at n=16A229422
- Number of compositions of n in which the minimal multiplicity of parts equals 4.at n=19A244167