2762
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 4146
- Proper Divisor Sum (Aliquot Sum)
- 1384
- 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
- 1380
- Möbius Function
- 1
- Radical
- 2762
- 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
- 128
- 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
- Numbers k such that phi(k) = phi(k+2).at n=44A001494
- Representation degeneracies for boson strings.at n=34A005290
- Coordination sequence T2 for Zeolite Code DDR.at n=33A008072
- Coordination sequence T3 for Zeolite Code GOO.at n=36A008113
- Coordination sequence T4 for Zeolite Code MFS.at n=33A008176
- If a, b in sequence, so is ab+6.at n=32A009307
- Numbers k such that the continued fraction for sqrt(k) has period 21.at n=21A020360
- Fibonacci sequence beginning 3, 10.at n=13A022122
- Place where n-th 1 occurs in A023119.at n=45A022781
- a(n) = 1*t(n) + 2*t(n-1) + ... + k*t(n+1-k), where k=floor((n+1)/2) and t = A008578 ({1} U primes).at n=20A023862
- a(n) = a(1)*a(n-1) + a(2)*a(n-2) + ...+ a(n-1)*a(1) for n >= 5, starting 1,0,-1,1.at n=14A025279
- a(n) = position of the n-th n in A026409.at n=48A026412
- Numbers n such that BCR(n) = n, where BCR = binary-complement-and-reverse = take one's complement then reverse bit order.at n=42A035928
- Number of primes less than 1000n.at n=24A038812
- Numbers whose base-14 representation has exactly 4 runs.at n=3A043665
- Numbers n such that string 0,8 occurs in the base 9 representation of n but not of n-1.at n=36A044259
- Numbers n such that string 6,2 occurs in the base 10 representation of n but not of n-1.at n=30A044394
- Numbers k such that string 0,8 occurs in the base 9 representation of k but not of k+1.at n=36A044640
- Numbers n such that string 7,0 occurs in the base 9 representation of n but not of n+1.at n=37A044695
- Numbers n such that string 6,2 occurs in the base 10 representation of n but not of n+1.at n=30A044775