5816
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
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 10920
- Proper Divisor Sum (Aliquot Sum)
- 5104
- 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
- 2904
- Möbius Function
- 0
- Radical
- 1454
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 49
- 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
- yes
- Odd
- no
Appears in sequences
- Numbers k such that k-th and (k+1)-st term of A038593 differ by 5.at n=7A038636
- A generalized difference set on the set of all integers (lambda = 2).at n=20A049399
- A simple grammar: pairs of cycles of cycles.at n=6A052822
- Number of 6 X 6 binary matrices with n ones, with no zero rows or columns, up to row and column permutation.at n=18A056037
- Numbers k such that phi(k)+sigma(k) is a perfect cube.at n=5A061366
- Numbers k such that z(k) = j(k), where z(k) = sopf(k - d(k)), j(k) = d(sopf(k) + k), sopf(k) = A008472(k) and d(k) = A000005(k).at n=15A063961
- a(1)=0, and a(n+1) is the position of first occurrence of a(n) in the decimal expansion of 1/Pi.at n=34A098319
- Triangular matrix T, read by rows, that satisfies: T^2 + T = SHIFTUP(T), also T^(n+1) + T^n = SHIFTUP(T^n - D*T^(n-1)) for all n, where D is a diagonal matrix with diagonal(D) = diagonal(T) = {1,2,3,...}.at n=15A103238
- Column 0 of triangular matrix T = A103238, which satisfies: T^2 + T = SHIFTUP(T) where diagonal(T)={1,2,3,...}.at n=5A103239
- G.f.: (1+x+x^2-sqrt(1+2x+3x^2-2x^3+x^4))*2.at n=17A129507
- The number of 1's in the n-th stage of A164349.at n=14A164363
- Partial sums of primes of the form 3*k-1.at n=36A172188
- Expansion of 1/(1 - x + x^2 - x^3 - x^6 + x^7 - x^8 + x^9 - x^10 + x^11 - x^12 -x^15 + x^16 - x^17 + x^18).at n=57A173911
- Triangle read by rows: T(n,k) is the number of up-down permutations of {1,2,...,n} having genus k (see first comment for definition of genus).at n=49A178516
- Number of increasing sequences of n integers x(1),...,x(n) with values in 1..3*n such that x(j) divides x(k) if j divides k.at n=11A180385
- T(n,k) = Number of n-turn bishop's tours on a k X k board summed over all starting positions.at n=39A188777
- Number of 4-turn bishop's tours on an n X n board summed over all starting positions.at n=5A188779
- A002110(n)-(p[i]+p[i+1]+...+p[i+n-1]), where p[i] is the largest prime such that this is nonnegative.at n=37A196129
- Number of n X 1 0..4 arrays with rows and columns lexicographically nondecreasing and no element equal to the number of horizontal and vertical neighbors equal to itself.at n=44A201722
- Triangle of coefficients of polynomials u(n,x) jointly generated with A209142; see the Formula section.at n=39A209141