1763
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
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 1848
- Proper Divisor Sum (Aliquot Sum)
- 85
- 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
- 1680
- Möbius Function
- 1
- Radical
- 1763
- 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
- 117
- 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
- a(n) = 4*n^2 - 1.at n=21A000466
- Numbers that are the sum of 3 nonnegative cubes in more than 1 way.at n=17A001239
- Number of n-node trees of height at most 4.at n=12A001384
- a(n) = (4*n+1)*(4*n+3).at n=10A001539
- Number of compositions of n into a sum of odd primes.at n=35A002124
- Representation degeneracies for Neveu-Schwarz strings.at n=13A005302
- First differences of A005579.at n=18A005347
- a(n) = n*(n+2) = (n+1)^2 - 1.at n=41A005563
- Products of 2 successive primes.at n=12A006094
- Optimal cost of search tree for searching an ordered array of n elements with cost k of probing element k.at n=28A007077
- 5th-order maximal independent sets in cycle graph.at n=42A007388
- Number of subsequences of [ 1,...,n ] in which each odd number has an even neighbor.at n=12A007455
- Number of subsequences of [ 1,...,n ] in which each even number has an odd neighbor.at n=12A007481
- a(n) is the number of subsequences of [ 1, ..., 2n ] in which each odd number has an even neighbor.at n=6A007482
- Repeatedly convert from decimal to octal.at n=18A008558
- Numbers that are the sum of 3 positive cubes in more than one way.at n=9A008917
- Coordination sequence T6 for Zeolite Code VNI.at n=26A009912
- a(n) = n*nextprime(n).at n=41A013636
- n*prevprime(n).at n=40A013637
- a(n) = prevprime(n)*nextprime(n).at n=39A013638