1994
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
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 2994
- Proper Divisor Sum (Aliquot Sum)
- 1000
- 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
- 996
- Möbius Function
- 1
- Radical
- 1994
- 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
- 50
- 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
- yes
- Odd
- no
Appears in sequences
- Smallest k such that the product of q/(q-1) over the primes from prime(n) to prime(n+k-1) is greater than 2.at n=30A001276
- Numbers k such that phi(k) = phi(k+2).at n=33A001494
- Bisection of A002470.at n=18A002286
- Glaisher's function W(n).at n=37A002470
- The number of partitions of {1..3n} that are invariant under a permutation consisting of n 3-cycles.at n=5A002874
- Coordination sequence T1 for Zeolite Code AFG.at n=31A008012
- Coordination sequence T2 for Zeolite Code ATT.at n=32A008042
- Coordination sequence T2 for Zeolite Code LTN.at n=31A008141
- a(n) = n + max_{0 <= i <n} ((n-i)*a(i)), a(0) = 1.at n=17A008609
- a(n) = floor(binomial(n,3)/3).at n=34A011849
- Molien series of 4-dimensional representation of u.g.g.r. #9.at n=8A013977
- Molien series of 4-dimensional representation of u.g.g.r. #8.at n=16A013978
- Seven iterations of Reverse and Add are needed to reach a palindrome.at n=28A015986
- Expansion of 1/(1-x^9-x^10-x^11-x^12-x^13-x^14-x^15-x^16-x^17-x^18).at n=56A017885
- Numbers k such that the continued fraction for sqrt(k) has period 17.at n=15A020356
- Index of 10^n within the sequence of the numbers of the form 2^i*10^j.at n=34A025740
- Positions of record values in A030787.at n=42A030792
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted then there are a pair of central terms both equal to 3.at n=26A031416
- Numbers k such that 183*2^k+1 is prime.at n=20A032468
- Numbers k such that 4 and 9 occur juxtaposed in the base-10 representation of k but not of k-1.at n=39A043250