6260
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 13188
- Proper Divisor Sum (Aliquot Sum)
- 6928
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2496
- Möbius Function
- 0
- Radical
- 3130
- Omega Function (Ω)
- 4
- 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
- 124
- 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
- Expansion of e.g.f. sinh(arctan(x) + log(x+1)).at n=7A012965
- Theta series of 6-dimensional lattice of det 8.at n=43A029543
- Numbers having four 0's in base 5.at n=29A043352
- Values of n such that 90n+11, 90n+13, 90n+17, 90n+19 are all primes.at n=38A051897
- Number of partitions of n into odious numbers (A000069).at n=49A067590
- Interprimes which are of the form s*prime, s=20.at n=8A075295
- Number of solutions to n^2 < x^2 + y^2 + z^2 < (n+1)^2; number of lattice points between spheres of radii n and n+1.at n=22A078184
- Diagonal sums of number array A082105.at n=11A082107
- Triangle read by rows: T(n,k) = number of peakless Motzkin paths of length n and having k weak ascents (1 <= k <= ceiling(n/3)).at n=37A114711
- Number of permutations of length n which avoid the patterns 213, 1234, 4312.at n=48A116720
- Number of permutations of length n which avoid the patterns 1342, 3421, 4312.at n=8A116838
- a(n) = 3 + floor((2 + Sum_{j=1..n-1} a(j))/4).at n=34A120162
- Connell (3,5)-sum sequence (partial sums of the (3,5)-Connell sequence).at n=66A122796
- Nonnegative values x of solutions (x, y) to the Diophantine equation x^2+(x+313)^2 = y^2.at n=6A129640
- Triangle read by rows: T(n,k) is the number of paths in the first quadrant from (0,0) to (n,0), consisting of steps U=(1,1), D=(1,-1), h=(1,0) and H=(2,0), having k U steps (0 <= k <= floor(n/2)).at n=38A132883
- a(n) = 250*n + 10.at n=24A154379
- G.f.: exp( Sum_{n>=1} [Sum_{k=0..2n} C(2n,k)^2*y^k]*x^n/n ) = Sum_{n>=0,k=0..2n} T(n,k)*x^n*y^k, as a triangle of coefficients T(n,k) read by rows.at n=28A181145
- G.f.: exp( Sum_{n>=1} [Sum_{k=0..2n} C(2n,k)^2*y^k]*x^n/n ) = Sum_{n>=0,k=0..2n} T(n,k)*x^n*y^k, as a triangle of coefficients T(n,k) read by rows.at n=32A181145
- Expansion of 1 + Sum_{n>=1} (x^(n^2) / Product_{k>=n} (1 - x^k)).at n=31A188216
- Number of (w,x,y,z) with all terms in {1,...,n} and 2w+2x=3y+3z.at n=31A212567