2299
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 2660
- Proper Divisor Sum (Aliquot Sum)
- 361
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 1980
- Möbius Function
- 0
- Radical
- 209
- Omega Function (Ω)
- 3
- 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
- 151
- 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
- no
- Odd
- yes
Appears in sequences
- Number of unrooted achiral trees with n nodes.at n=25A003244
- Expansion of g.f.: (1+x^3)*(1+x^4)/((1-x)*(1-x^2)^2*(1-x^4)).at n=37A004657
- Ruth-Aaron numbers (1): sum of prime divisors of n = sum of prime divisors of n+1.at n=11A006145
- a(n) = (n^3 + 2*n)/3.at n=19A006527
- Join 2n points on a line with n arcs above the line; form graph with the arcs as nodes, joining 2 nodes when the arcs cross. a(n) is the number of cases in which the graph is symmetric about middle and has no isolated nodes.at n=7A008910
- Expansion of Product_{k>=1} (1 - x^k)^11.at n=26A010819
- a(n) = (2*n - 3)n^2.at n=11A015238
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite CHI = Chiavennite Ca4Mn4[Be8Si20O52(OH)8].8H2O starting with a T3 atom.at n=12A019093
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly five 1's.at n=22A020441
- Place where n-th 1 occurs in A023119.at n=41A022781
- a(n) = position of 5 + n^2 in A004432.at n=51A024808
- a(n) = A027082(n, 2n-2).at n=7A027089
- a(n) = greatest number in row n of array T given by A027082.at n=9A027102
- Sums of six consecutive squares: a(n) = n^2 + (n+1)^2 + (n+2)^2 + (n+3)^2 + (n+4)^2 + (n+5)^2.at n=17A027865
- a(n) = n^2 - 5.at n=48A028875
- Every run of digits of n in base 10 has length 2.at n=26A033008
- Numbers whose base-10 expansion has no run of digits with length < 2.at n=37A033023
- Divisors = 3 (mod 4) of Descartes's 198585576189.at n=32A033871
- Expansion of sum ( q^n / product( 1-q^k, k=1..3*n), n=0..inf ).at n=22A035295
- Number of partitions of n into parts not of the form 15k, 15k+7 or 15k-7. Also number of partitions with at most 6 parts of size 1 and differences between parts at distance 6 are greater than 1.at n=28A035961