5690
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
- 8
- Divisor Sum
- 10260
- Proper Divisor Sum (Aliquot Sum)
- 4570
- 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
- 2272
- Möbius Function
- -1
- Radical
- 5690
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 67
- 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
- yes
- Odd
- no
Appears in sequences
- Number of ethylene derivatives with n carbon atoms.at n=11A000631
- Cluster series for b.c.c. lattice.at n=5A003210
- Number of partitions of n into partition numbers.at n=50A007279
- Starting from generation 7 add previous and next term yielding generation 8.at n=13A048454
- a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 3, where m = 2*n - 2 - 2^(p+1) and p is the unique integer such that 2^p < n-1 <= 2^(p+1), starting with a(1) = a(2) = 1.at n=12A049943
- Number of basis partitions of n+16 with Durfee square size 4.at n=37A053798
- Triangle read by rows: T(n,k) is the number of ordered trees with n edges and having k branches of even length (n>=0, 0<=k<=floor(n/2)).at n=32A102004
- Numbers n such that sigma(n)=2n-phi(phi(n)).at n=9A110073
- Number of digits in the n-th Woodall prime.at n=20A137811
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 0), (-1, 1, -1), (1, -1, 0), (1, 1, 0)}.at n=8A149127
- Least k(n) such that 3*2^k(n)*M(n)-1 or 3*2^k(n)*M(n)+1 is prime (or both primes) with M(i)=i-th Mersenne prime.at n=24A152097
- a(n) is the number of numbers m such that the number of iterations of r -> r - (largest divisor d < r) needed to reach 1 starting at r = m is equal to n.at n=18A175125
- a(n) = n*prime(n) - sum_{i=1..n-1} prime(i).at n=46A189892
- a(n) = Sum_{k=0..n} (k+1)^(n-1)*k!*StirlingS2(n,k).at n=4A191908
- Number of 2 X 2 matrices with all elements in {0,1,...,n} and determinant >= 2n.at n=11A210367
- Number of (n+1)X(n+1) -8..8 symmetric matrices with every 2X2 subblock having sum zero and three distinct values.at n=6A211467
- Number of (w,x,y,z) with all terms in {1,...,n} and 2w=x+y+z.at n=24A212068
- Principal diagonal of the convolution array A213825.at n=9A213826
- Number of 3 X 3 X 3 triangular 0..n arrays with every horizontal row nondecreasing and having the same average value.at n=20A214907
- Numbers which are the sum of two squared primes in exactly two ways (ignoring order).at n=31A226539