2392
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 5040
- Proper Divisor Sum (Aliquot Sum)
- 2648
- 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
- 1056
- Möbius Function
- 0
- Radical
- 598
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 120
- 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
- Red rooted red-black trees with n internal nodes.at n=13A001138
- Number of transitive permutation groups of degree n.at n=26A002106
- Coordination sequence T2 for Zeolite Code LTN.at n=34A008141
- Numbers n such that phi(n) * sigma(n) + 9 is a perfect square.at n=27A015728
- Number of 3's in partitions of n into distinct parts.at n=53A015737
- Number of partitions of n into distinct parts, none being 3.at n=51A015745
- a(n) is the concatenation of n and 4n.at n=22A019552
- a(n) = n*(9*n + 1)/2.at n=23A022267
- a(n) = s(1)*s(n) + s(2)*s(n-1) + ... + s(k)*s(n+1-k), where k = floor((n+1)/2), s = (natural numbers >= 3).at n=25A024312
- a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n-k+1), where k = floor( n/2 ), s = natural numbers >= 3.at n=24A024875
- Coordination sequence T2 for Zeolite Code CGS.at n=36A027366
- a(n) = n*(n + 6).at n=46A028560
- Numbers n such that n divides the (right) concatenation of all numbers <= n written in base 14 (most significant digit on right).at n=16A029507
- Every run of digits of n in base 7 has length 2.at n=41A033005
- Fractional part of square root of a(n) starts with 9: first term of runs.at n=43A034115
- Number of partitions in parts not of the form 11k, 11k+3 or 11k-3. Also number of partitions with at most 2 parts of size 1 and differences between parts at distance 4 are greater than 1.at n=31A035946
- Number of partitions satisfying cn(2,5) < cn(1,5) + cn(4,5) and cn(3,5) < cn(1,5) + cn(4,5).at n=27A039889
- Number of partitions satisfying 0 < cn(1,5) + cn(4,5) + cn(2,5) and 0 < cn(1,5) + cn(4,5) + cn(3,5).at n=26A039902
- Numbers n such that string 4,7 occurs in the base 9 representation of n but not of n-1.at n=32A044294
- Numbers n such that string 9,2 occurs in the base 10 representation of n but not of n-1.at n=25A044424