17363
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 17640
- Proper Divisor Sum (Aliquot Sum)
- 277
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 17088
- Möbius Function
- 1
- Radical
- 17363
- 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
- 79
- 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
- Numbers k such that 231*2^k-1 is prime.at n=48A050867
- Number of asymmetric (identity) trees with n nodes and 4 leaves.at n=38A055335
- Rounded total surface area of a regular dodecahedron with edge length n.at n=29A071397
- Number of n X n binary arrays symmetric under horizontal reflection with all ones connected only in a 2X2 block with tail 1,1 1,2 1,3 2,2 2,3 in any orientation.at n=8A146047
- Number of nX4 0..1 arrays with no element less than a strict majority of its horizontal and vertical neighbors.at n=4A231378
- Number of nX5 0..1 arrays with no element less than a strict majority of its horizontal and vertical neighbors.at n=3A231379
- T(n,k)=Number of nXk 0..1 arrays with no element less than a strict majority of its horizontal and vertical neighbors.at n=31A231382
- T(n,k)=Number of nXk 0..1 arrays with no element less than a strict majority of its horizontal and vertical neighbors.at n=32A231382
- Number of partitions of n containing at least one prime.at n=36A235945
- Composite numbers whose concatenation of their aliquot parts, in descending order, is a palindrome.at n=28A249301
- Cardinalities of the sets of fusible numbers obtained at the consecutive steps of their construction as follows. We set S(0) = {0}. S(n+1) is obtained by adding to S(n) the sums (x+y+1)/2 for all x,y from S(n) with the property |x-y| < 1. Then, a(n) is the number of elements in S(n).at n=12A343264
- Numbers that are the sum of eight fourth powers in eight or more ways.at n=15A345583
- Numbers that are the sum of eight fourth powers in exactly eight ways.at n=12A345840
- a(n) = A366470(A366864(n)).at n=10A366869
- Number of winning positions of Gordon Hamilton's Jumping Frogs game with n single frogs, up to left-right symmetry.at n=10A378004