2282
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 3936
- Proper Divisor Sum (Aliquot Sum)
- 1654
- 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
- 972
- Möbius Function
- -1
- Radical
- 2282
- Omega Function (Ω)
- 3
- 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
- 107
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- 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 inequivalent ways of dissecting a regular (n+2)-gon into n triangles by n-1 non-intersecting diagonals under rotations and reflections; also the number of (unlabeled) maximal outerplanar graphs on n+2 vertices.at n=10A000207
- Expansion of 1/((1-x)^2*(1-x^2)*(1-x^3)).at n=40A000601
- Number of sensed planar maps with n edges and without faces of degree 1.at n=7A006388
- Number of rooted toroidal maps with 2 faces and n vertices and without separating cycles or isthmuses.at n=4A006422
- Number of factors in the infinite word formed by the Kolakoski sequence A000002.at n=49A007782
- Coordination sequence T5 for Zeolite Code RSN.at n=31A009889
- Number of trees on n nodes with 3 forbidden limbs of size 4, 5 and 6.at n=12A014278
- Coordination sequence T2 for Zeolite Code OSI.at n=31A016431
- Partial sums of the sequence of prime powers (A000961).at n=43A024918
- a(1) = 7; a(n+1) = a(n)-th nonprime, where nonprimes begin at 0.at n=23A025002
- a(n) = floor(floor(S3)/floor(S1)), where S3 and S1 are, respectively, the 3rd and first elementary symmetric functions of {sqrt(k), k = 1,2,...,n}.at n=29A025200
- a(n) = T(n,0) + T(n,1) + ... + T(n,[ n/2 ]), T given by A027170.at n=9A027179
- Sequence satisfies T(T(a))=a, where T is defined below.at n=50A027581
- Number of rooted trees where root has degree 4.at n=9A029855
- Number of partitions of n with equal nonzero number of parts congruent to each of 0 and 2 (mod 3).at n=36A035538
- Number of partitions of n with equal nonzero number of parts congruent to each of 0, 1 and 4 (mod 5).at n=48A035584
- Number of partitions of n into parts not a multiple of 7. Also number of partitions with at most 6 parts of size 1 and differences between parts at distance 9 are greater than 1.at n=27A035985
- Trajectory of 3 under map n->15n+1 if n odd, n->n/2 if n even.at n=15A037105
- Total number of fixed points in free homeomorphically irreducible trees with n nodes.at n=16A037246
- Number of partitions satisfying cn(0,5) + cn(2,5) + cn(3,5) <= 1.at n=40A039853