6740
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 14196
- Proper Divisor Sum (Aliquot Sum)
- 7456
- 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
- 2688
- Möbius Function
- 0
- Radical
- 3370
- 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
- 44
- 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
- Coordination sequence for 4-dimensional face-centered cubic orthogonal lattice.at n=10A008529
- Expansion of -(2*x^3-x^2+x-1)/(x^4-3*x^3+3*x^2-3*x+1).at n=12A013326
- Multiplicity of highest weight (or singular) vectors associated with character chi_118 of Monster module.at n=37A034506
- Susceptibility series H_2 for 2-dimensional Ising model (divided by 2).at n=35A054275
- Number of polyiamonds with n cells that do not tile the plane.at n=12A071333
- Nonnegative values x of solutions (x, y) to the Diophantine equation x^2+(x+337)^2 = y^2.at n=6A129999
- 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, 0), (-1, 1, 1), (0, 0, -1), (1, 0, 1)}.at n=9A148672
- 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, 1, 1), (0, 0, 1), (0, 1, -1), (1, 0, 1)}.at n=7A150418
- 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, -1, 0), (0, 1, 0), (1, 1, -1), (1, 1, 1)}.at n=7A150459
- a(n) = 250*n - 10.at n=26A154378
- Integer part of square root of n^5 = A000584(n).at n=33A155013
- Number of (n+1) X 2 0..1 arrays with the determinants of 2 X 2 subblocks nondecreasing rightwards and downwards.at n=6A204609
- Number of (n+1)X8 0..1 arrays with the determinants of 2X2 subblocks nondecreasing rightwards and downwards.at n=0A204615
- T(n,k) = Number of (n+1) X (k+1) 0..1 arrays with the determinants of 2 X 2 subblocks nondecreasing rightwards and downwards.at n=27A204616
- T(n,k) = Number of (n+1) X (k+1) 0..1 arrays with the determinants of 2 X 2 subblocks nondecreasing rightwards and downwards.at n=21A204616
- Number of (n+1)X8 0..1 arrays with rows and columns of determinants of all 2X2 subblocks lexicographically nondecreasing.at n=0A204799
- T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with rows and columns of determinants of all 2X2 subblocks lexicographically nondecreasing.at n=21A204800
- T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with rows and columns of determinants of all 2X2 subblocks lexicographically nondecreasing.at n=27A204800
- a(n) = n*prime(prime(n)) - prime(n)^2.at n=32A230098
- Number of partitions p of n including round(mean(p)) as a part. (This is "Mathematica round").at n=34A241338