2773
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
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 2880
- Proper Divisor Sum (Aliquot Sum)
- 107
- 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
- 2668
- Möbius Function
- 1
- Radical
- 2773
- 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
- 35
- 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
- no
- Odd
- yes
Appears in sequences
- Centered 12-gonal numbers, or centered dodecagonal numbers: numbers of the form 6*k*(k-1) + 1.at n=21A003154
- a(n) = 1000*log(n) rounded to the nearest integer.at n=15A004241
- a(n) = ceiling(1000*log(n)).at n=15A004242
- Pisot sequence E(8,14), a(n)=[ a(n-1)^2/a(n-2)+1/2 ].at n=10A014002
- Numbers k such that Fibonacci(k) == 89 (mod k).at n=36A023182
- Prefix primes in base 8 (written in base 8).at n=32A024768
- Least m such that if r and s in {1/3, 1/6, 1/9, ..., 1/3n} satisfy r < s, then r < k/m < (k+1)/m < s for some integer k.at n=23A024838
- a(n) = least m such that if r and s in {1/1, 1/3, 1/5, ..., 1/(2n-1)} satisfy r < s, then r < k/m < (k+4)/m < s for some integer k.at n=17A024847
- Lucky numbers with size of gaps equal to 8 (lower terms).at n=31A031890
- Lucky numbers with size of gaps equal to 10 (upper terms).at n=28A031893
- Numbers k such that 83*2^k+1 is prime.at n=7A032391
- Numbers k such that 119*2^k + 1 is prime.at n=11A032409
- Concentric hexagonal numbers: floor(3*n^2/2).at n=43A032528
- a(n) = floor(10000/sqrt(n)).at n=12A033433
- Least k such that A033178(k)=n.at n=32A038004
- Coordination sequence T4 for Zeolite Code ESV.at n=35A038411
- Coordination sequence T5 for Zeolite Code ESV.at n=35A038414
- a(n) is the smallest composite number c such that A002110(n) + c is prime.at n=14A038771
- Numbers whose base-2 representation has exactly 11 runs.at n=9A043578
- Numbers whose base-14 representation has exactly 4 runs.at n=14A043665