6496
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 15120
- Proper Divisor Sum (Aliquot Sum)
- 8624
- 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
- 406
- Omega Function (Ω)
- 7
- 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
- a(n) = 3 + n/2 + 7*n^2/2.at n=43A006124
- dot_product(n,n-1,...2,1)*(7,8,...,n,1,2,3,4,5,6).at n=22A026066
- Numbers k such that 223*2^k+1 is prime.at n=24A032488
- Total number of possible knight moves on an (n+2) X (n+2) chessboard, if the knight is placed anywhere.at n=28A035008
- Geometric mean of the digits = 6. In other words, the product of the digits is = 6^k where k is the number of digits.at n=35A061429
- Numbers k such that (3^k - 7)/2 is prime.at n=10A063679
- Number of cyclic subgroups of the group C_n X C_n X C_n (where C_n is the cyclic group of order n).at n=41A064969
- Numbers that define integer Heronian triangles [prime(a(n)), prime(a(n)+1), A068965(n)] with area A068966(n).at n=15A068964
- Number of 4-ary Lyndon words of length n over Z_4 with trace 0 and subtrace 2.at n=9A074404
- Number of 4-ary Lyndon words of length n over Z_4 with trace 2 and subtrace 3.at n=9A074413
- Fourth power of lower triangular matrix of A056857 (successive equalities in set partitions of n).at n=41A078939
- q such that p^4 + q^4 = r^4 + s^4 = a(n).at n=43A088665
- Matrix square of triangle A091613.at n=66A091615
- Column 1 of triangle A091615.at n=11A091622
- Triangle, read by rows, of trinomial coefficients arranged so that there are n+1 terms in row n by setting T(n,k) equal to the coefficient of z^k in (2 + 3*z + z^2)^(n-[k/2]), for n>=k>=0, where [k/2] is the integer floor of k/2.at n=38A099527
- Triangle read by rows: T(n,k) is the number of ordered trees with n edges and having k branches of odd length (n>=0, 0<=k<=n).at n=61A102003
- Numbers n such that 2*prime(n) - prime(n+1) is a square.at n=37A110975
- Riordan array (1/(1-2x), x(1-x)/(1-2x)^2).at n=38A114164
- Row sums of correlation triangle for floor((n+3)/3).at n=36A115266
- Riordan array (1/(1+2*x), x*(1+x)/(1+2*x)^2).at n=38A123876