2837
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 2838
- 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
- 2836
- Möbius Function
- -1
- Radical
- 2837
- 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
- 35
- 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
- 412
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- From relations between Siegel theta series.at n=33A006476
- Prime(n)*...*prime(a(n)) is the least product of consecutive primes that is non-deficient.at n=35A007684
- Prime(n)*...*prime(a(n)) is the least product of consecutive primes which is abundant.at n=35A007707
- Coordination sequence T2 for Zeolite Code EUO.at n=33A008097
- Coordination sequence T1 for Zeolite Code LTN.at n=37A008140
- Coordination sequence T3 for Zeolite Code MFS.at n=33A008175
- If a, b in sequence, so is ab+7.at n=25A009312
- Levine's sequence. First construct a triangle as follows. Row 1 is {1,1}; if row n is {r_1, ..., r_k} then row n+1 consists of {r_k 1's, r_{k-1} 2's, r_{k-2} 3's, etc.}; sequence consists of the final elements in each row.at n=9A011784
- Coordination sequence T7 for Zeolite Code TER.at n=36A016439
- Numbers k such that the continued fraction for sqrt(k) has period 13.at n=16A020352
- Place where n-th 1 occurs in A023123.at n=45A022785
- Positive numbers k such that k and 3*k are anagrams in base 9 (written in base 9).at n=32A023080
- Primes that remain prime through 2 iterations of the function f(x) = 3*x + 2.at n=31A023246
- Primes that remain prime through 2 iterations of function f(x) = 6x + 7.at n=39A023258
- Primes that remain prime through 2 iterations of function f(x) = 9x + 4.at n=38A023266
- a(n) = (1/2)*s(n+3), where s = A025244.at n=9A025245
- a(n) = a(1)*a(n-1) + a(2)*a(n-2) + ... + a(n-3)*a(3) for n >= 4, with initial terms 1, 3, 1, 1.at n=11A025255
- a(n) = prime(10*n-8).at n=41A031919
- Concatenation of n and n + 9 or {n,n+9}.at n=27A032614
- Primes that are decimal concatenations of n with n + 9.at n=4A032632