2993
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 3108
- Proper Divisor Sum (Aliquot Sum)
- 115
- 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
- 2880
- Möbius Function
- 1
- Radical
- 2993
- Omega Function (Ω)
- 2
- 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
- 48
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = a(n-1) + 2*a(n-2) - a(n-3), with a(0) = a(1) = 0, a(2) = 1.at n=16A006053
- Coordination sequence T1 for Zeolite Code AFO.at n=36A008015
- Coordination sequence T2 for Zeolite Code AWW.at n=39A008046
- Coordination sequence T1 for Zeolite Code MFS.at n=34A008173
- Coordination sequence T2 for Zeolite Code PAU.at n=40A008220
- Coordination sequence T3 for Zeolite Code PAU.at n=40A008221
- Molien series for 6-dimensional complex reflection group 4.U_4 (3) of order 2^9 .3^7 .5.7.at n=39A008581
- sec(sin(tan(x)))=1+1/2!*x^2+9/4!*x^4+153/6!*x^6+2993/8!*x^8...at n=4A012017
- a(n) = Sum_{m=1..n} Sum_{k=1..m} prime(k).at n=17A014148
- Seven iterations of Reverse and Add are needed to reach a palindrome.at n=40A015986
- Pseudoprimes to base 27.at n=26A020155
- Pseudoprimes to base 83.at n=32A020211
- Place where n-th 1 occurs in A023133.at n=43A022795
- a(n) = [ a(n-1)/a(1) + a(n-3)/a(3) + a(n-5)/a(5) + ... ], for n >= 3.at n=32A022871
- a(n) = least m such that if r and s in {1/2, 1/5, 1/8, ..., 1/(3n-1)} satisfy r < s, then r < k/m < (k+1)/m < s for some integer k.at n=24A024837
- Sequence A025513 divided by 2.at n=1A025514
- Diagonal sum of left-justified array T given by A027023.at n=22A027037
- Number of decimal digits in n-th Mersenne prime.at n=21A028335
- For n>0, a(n) is the least quasi-Carmichael number to base n; a(0) = least composite squarefree integer.at n=33A029590
- Convolution of Thue-Morse sequence A001285 with A008578 = {1, primes}.at n=33A029896