2287
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 2288
- Proper Divisor Sum (Aliquot Sum)
- 1
- 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
- 2286
- Möbius Function
- -1
- Radical
- 2287
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 120
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 340
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes p such that the multiplicative order of 2 modulo p is (p-1)/6.at n=14A001136
- a(n) = solution to the postage stamp problem with n denominations and 6 stamps.at n=9A001216
- Balanced primes (of order one): primes which are the average of the previous prime and the following prime.at n=24A006562
- Primes that divide at least one term of Sylvester's sequence s = A000058: s(n+1) = s(n)^2 - s(n) + 1, s(0) = 2.at n=16A007996
- Coordination sequence T1 for Zeolite Code DDR.at n=30A008071
- Coordination sequence T1 for Zeolite Code MOR.at n=31A008182
- Coordination sequence T4 for Zeolite Code PAU.at n=35A008222
- Coordination sequence T2 for Zeolite Code -CHI.at n=30A009847
- a(n) = a(n-1)+a(n-4).at n=23A014097
- Numbers k such that the continued fraction for sqrt(k) has period 48.at n=12A020387
- Primes that remain prime through 2 iterations of function f(x) = 4x + 3.at n=31A023250
- Primes that remain prime through 2 iterations of function f(x) = 4x + 9.at n=42A023251
- Primes that remain prime through 2 iterations of the function f(x) = 5x + 8.at n=26A023255
- Primes that remain prime through 2 iterations of function f(x) = 6x + 1.at n=25A023256
- Every suffix prime and no 0 digits in base 9 (written in base 9).at n=28A024784
- Position of numbers of form 3*n^2 in A025060 (numbers of form j*k + k*i + i*j, where 1 <=i < j < k).at n=24A025064
- a(n) = floor(floor(S3)/floor(S1)); where S3 and S1 are, respectively, the third and first elementary symmetric functions of {log(k)}, k = 1,2,...,n.at n=39A025210
- a(n) = (1/4 + 1/6 + ... + 1/c(n))*LCM{4, 6, ..., c(n)}, where c(n) = n-th composite number.at n=6A025545
- Primes such that in p^2 the parity of digits alternates.at n=26A030145
- a(n) = prime(10*n).at n=33A031343