2767
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 2768
- 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
- 2766
- Möbius Function
- -1
- Radical
- 2767
- 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
- 97
- 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
- 403
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Construct a triangle as in A036262. Sequence is one less than the position of the first number larger than 2 in the n-th row (n-th difference).at n=42A000232
- Primes p such that the multiplicative order of 2 modulo p is (p-1)/6.at n=17A001136
- Primes of the form 2*k^2 + 29.at n=33A007641
- Numbers n such that phi(n + 9) | sigma(n) for n not congruent to 0 (mod 3).at n=44A015849
- Numbers k such that the continued fraction for sqrt(k) has period 60.at n=7A020399
- Let c(k) denote the k-th composite number and p(k) the k-th prime number; then a(n) = Sum_{i=n*(n-1)/2+1 .. n*(n+1)/2} c(i) - Sum_{i=1..n} p(i).at n=16A024850
- Sum of the numbers between the two n's in A026362.at n=27A026365
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 51.at n=19A031549
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 34 ones.at n=8A031802
- a(n) = prime(10*n-7).at n=40A031917
- Lower prime of a difference of 10 between consecutive primes.at n=38A031928
- Upper prime of a difference of 14 between consecutive primes.at n=14A031933
- Number of ways to partition n labeled elements into pie slices of different sizes other than one.at n=9A032146
- Primes of form x^2+31*y^2.at n=61A033221
- Primes of form x^2+62*y^2.at n=24A033240
- Position of first term > 2 in n-th row of Gilbreath array shown in A036262.at n=44A036277
- Number of stereoisomers of all n-node acyclic hydrocarbons with no triple bonds.at n=8A036673
- Coordination sequence for Zeolite Code DFT.at n=36A038408
- Coordination sequence T6 for Zeolite Code STT.at n=35A038421
- Denominators of continued fraction convergents to sqrt(274).at n=7A041515