2002
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 4
- Digital Root
- 4
- Palindromic Number
- yes
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 4032
- Proper Divisor Sum (Aliquot Sum)
- 2030
- 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
- 720
- Möbius Function
- 1
- Radical
- 2002
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 143
- 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
- Binomial coefficients C(n,5).at n=14A000389
- a(n) = binomial coefficient C(n,9).at n=5A000582
- a(n) = 3^n + 5^n + 6^n.at n=4A001579
- A self-generating sequence: every positive integer occurs as a(i)-a(j) for a unique pair i,j.at n=17A001856
- Fourth convolution of Catalan numbers: a(n) = 4*binomial(2*n+3,n)/(n+4).at n=6A002057
- Binomial coefficients C(2n, n-2).at n=5A002694
- Numbers whose square is a palindrome.at n=17A002778
- Numbers which are the sum of 3 nonzero 4th powers.at n=47A003337
- Define predecessors of n, P(n), to consist of numbers whose binary representation is obtained from that of n by replacing 10 with 01 or changing a final 1 to a 0; then a(0)=1, a(n) = Sum a(P(n)), n>0.at n=46A004065
- Number of unrooted triangulations with reflection symmetry of a disk with one internal node and n+3 nodes on the boundary.at n=13A005508
- a(n) = (n-1)*n*(n+4)/6.at n=22A005581
- Primitive pseudoperfect numbers.at n=32A006036
- Primitive nondeficient numbers.at n=27A006039
- From the enumeration of corners.at n=5A006332
- From the enumeration of corners.at n=3A006334
- 'Eban' numbers (the letter 'e' is banned!).at n=20A006933
- Number of matchings in rooted plane trees on n nodes.at n=6A007859
- Coordination sequence T5 for Zeolite Code DDR.at n=28A008075
- Coordination sequence T2 for Zeolite Code SGT.at n=28A008230
- Coordination sequence T2 for feldspar.at n=30A008255