2871
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 4680
- Proper Divisor Sum (Aliquot Sum)
- 1809
- 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
- 1680
- Möbius Function
- 0
- Radical
- 957
- Omega Function (Ω)
- 4
- 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
- 79
- 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 dissections of a convex (n+2)-gon into triangles and quadrilaterals by nonintersecting diagonals.at n=7A001002
- 9-gonal (or enneagonal or nonagonal) numbers: a(n) = n*(7*n-5)/2.at n=29A001106
- Sum of cubes of first n Fibonacci numbers.at n=7A005968
- Coordination sequence T2 for Zeolite Code MAZ.at n=37A008145
- Let j = | i - i_written_backwards |, k = j + j_written_backwards; then k is in this sequence.at n=26A008920
- Coordination sequence T3 for Zeolite Code -CLO.at n=47A009852
- a(n) = 6*a(n-1) - a(n-2) - 2 with a(0) = 1, a(1) = 3.at n=5A011900
- Numbers n such that phi(n) * sigma(n) + 16 is a perfect square.at n=44A015729
- Expansion of 1/(1 - x^4 - x^5 - x^6 - x^7).at n=37A017829
- Pseudoprimes to base 28.at n=20A020156
- Pseudoprimes to base 35.at n=15A020163
- Pseudoprimes to base 53.at n=31A020181
- Pseudoprimes to base 62.at n=27A020190
- Pseudoprimes to base 71.at n=27A020199
- Pseudoprimes to base 80.at n=24A020208
- Pseudoprimes to base 82.at n=39A020210
- Pseudoprimes to base 91.at n=32A020219
- Pseudoprimes to base 100.at n=24A020228
- Strong pseudoprimes to base 35.at n=3A020261
- Strong pseudoprimes to base 62.at n=9A020288