5696
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 14
- Divisor Sum
- 11430
- Proper Divisor Sum (Aliquot Sum)
- 5734
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 2816
- Möbius Function
- 0
- Radical
- 178
- Omega Function (Ω)
- 7
- 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
- 36
- 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
- Number of permutations of length n with spread 0.at n=7A004204
- Number of inequivalent ways to color vertices of a regular tetrahedron using <= n colors.at n=16A006008
- Coordination sequence T10 for Zeolite Code EUO.at n=47A008096
- Expansion of exp(tanh(x))/exp(x).at n=9A009266
- Spontaneous magnetization coefficients for square lattice spin 2 Ising model.at n=48A010103
- Number of partitions of n into 8 unordered relatively prime parts.at n=36A023028
- Numbers that are the sum of 4 nonzero squares in exactly 7 ways.at n=35A025363
- a(n) = T(n, n-3), T given by A026552. Also a(n) = number of integer strings s(0), ..., s(n) counted by T, such that s(n) = 3.at n=9A026556
- T(n, 2*n-4), T given by A027960.at n=17A027966
- Numbers with 14 divisors.at n=25A030632
- Similar submodules in cubian ring of index f(n)^2 where f(n) is the n-th positive integer represented by the quadratic form x^2 - 2 y^2.at n=40A035285
- Number of connected numbers (A029827) in the interval [2^(n-1)+1, 2^n].at n=15A036381
- Numbers n such that 249*2^n-1 is prime.at n=15A050883
- Scaled Chebyshev U-polynomials evaluated at i*sqrt(2). Generalized Fibonacci sequence.at n=4A057091
- Number of 2 X 2 singular integer matrices with elements from {0,...,n}.at n=27A059306
- Triangle T(n,k), 0<=k<=n, formed from coefficients when formula for n-th diagonal of triangle in A059718 is written as a sum of binomial coefficients.at n=33A059720
- Consider the line segment in R^n from the origin to the point v=(2,3,5,7,11,...) with prime coordinates; let d = squared distance to this line from the closest point of Z^n (excluding the endpoints). Sequence gives d times v.v.at n=12A059804
- Numbers k such that phi(x) = k has exactly 7 solutions.at n=35A060670
- Numbers which need 12 'Reverse and Add' steps to reach a palindrome.at n=40A065217
- Triangle of T(n,k) where T(n,k)/(n-1)! is probability of player k out of n players winning a game of "Elimination": rules are that player 1 chooses one of the others at random to be eliminated, then player 2 (or 3 if player 2 has been eliminated) chooses somebody else at random from the survivors to be eliminated next, then the next surviving player chooses and so on round the circle until all but one have been eliminated.at n=41A071818