2136
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 5400
- Proper Divisor Sum (Aliquot Sum)
- 3264
- 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
- 704
- Möbius Function
- 0
- Radical
- 534
- Omega Function (Ω)
- 5
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 24
- 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 graphical partitions of 2n.at n=14A000569
- Number of 3-uniform hypergraphs on n unlabeled nodes, or equivalently number of relations with 3 arguments on n nodes.at n=6A000665
- Terms in certain determinants.at n=4A002776
- n+8*C(n,2)+30*C(n,3)+62*C(n,4)+75*C(n,5)+30*C(n,6).at n=6A006550
- Number of non-Abelian metacyclic groups of order p^n (p odd).at n=49A007983
- Coordination sequence T7 for Zeolite Code MTT.at n=28A008195
- Fibonacci sequence beginning 0, 24.at n=11A022358
- Convolution of A023532 and A001950.at n=44A023603
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (natural numbers), t = A001950 (upper Wythoff sequence).at n=19A024864
- Numbers that are the sum of 4 distinct positive cubes in exactly 2 ways.at n=26A025409
- Numbers that are the sum of 4 distinct positive cubes in 2 or more ways.at n=27A025412
- a(n) = number of (s(0), s(1), ..., s(n)) such that every s(i) is an integer, s(0) = 0, |s(i) - s(i-1)| = 1 for i = 1,2; |s(i) - s(i-1)| <= 1 for i >= 3, s(n) = 3. Also a(n) = T(n,n-3), where T is the array defined in A024996.at n=7A026070
- T(2n+1,n+4), T given by A026780.at n=4A026901
- a(n) = Sum_{k=0..2n-3} T(n,k) * T(n,k+3), with T given by A025177.at n=2A027260
- Iterate the map in A006368 starting at 8.at n=48A028393
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 11.at n=21A031509
- a(n) = n * prime(n).at n=23A033286
- Multiplicity of highest weight (or singular) vectors associated with character chi_38 of Monster module.at n=32A034426
- Dirichlet convolution of primes (A000040) with themselves.at n=49A034696
- Numbers for which the sum of reciprocals of digits is an integer.at n=33A034708