17
domain: N
Properties
Digital Properties
- Digit Count
- 2
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 18
- 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
- 16
- Möbius Function
- -1
- Radical
- 17
- 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
- 12
- Smith Number
- no
Classification
- Natural
- yes
- Even
- no
- Odd
- yes
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- yes
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 7
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Names
- German
- siebzehn· ordinal: siebzehnte
- English
- seventeen· ordinal: seventeenth
- Spanish
- diecisiete· ordinal: decimoséptimo
- French
- dix-sept· ordinal: dix-septième
- Italian
- diciassette· ordinal: 17º
- Latin
- septendecim· ordinal: 17.
- Portuguese
- dezessete· ordinal: 17º
Appears in sequences
- Integer part of square root of n-th prime.at n=61A000006
- Integer part of square root of n-th prime.at n=62A000006
- Integer part of square root of n-th prime.at n=63A000006
- Integer part of square root of n-th prime.at n=64A000006
- Integer part of square root of n-th prime.at n=65A000006
- Smallest prime power >= n.at n=16A000015
- Number of positive integers <= 2^n of form x^2 + 12 y^2.at n=6A000021
- Mosaic numbers or multiplicative projection of n: if n = Product (p_j^k_j) then a(n) = Product (p_j * k_j).at n=16A000026
- The positive integers. Also called the natural numbers, the whole numbers or the counting numbers, but these terms are ambiguous.at n=16A000027
- Let k = p_1^e_1 p_2^e_2 p_3^e_3 ... be the prime factorization of n. Sequence gives k such that the sum of the numbers of 1's in the binary expansions of e_1, e_2, e_3, ... is odd.at n=9A000028
- Let A(n) = #{(i,j): i^2 + j^2 <= n}, V(n) = Pi*n, P(n) = A(n) - V(n); A000099 gives values of n where |P(n)| sets a new record; sequence gives closest integer to P(A000099(n)).at n=14A000036
- Let A(n) = #{(i,j): i^2 + j^2 <= n}, V(n) = Pi*n, P(n) = A(n) - V(n); A000099 gives values of n where |P(n)| sets a new record; sequence gives closest integer to P(A000099(n)).at n=15A000036
- Numbers that are not squares (or, the nonsquares).at n=12A000037
- Mersenne exponents: primes p such that 2^p - 1 is prime. Then 2^p - 1 is called a Mersenne prime.at n=5A000043
- a(n) = 2^n + 1.at n=4A000051
- 1-digit numbers arranged in alphabetical order, then the 2-digit numbers arranged in alphabetical order, then the 3-digit numbers, etc.at n=55A000052
- Numbers k such that (2k)^4 + 1 is prime.at n=7A000059
- Number of partitions of n if there are two kinds of 1's and two kinds of 2's.at n=4A000097
- Number of partitions of n into 6 squares.at n=83A000177
- Number of partitions of n into 6 squares.at n=85A000177