1712
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 3348
- Proper Divisor Sum (Aliquot Sum)
- 1636
- 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
- 848
- Möbius Function
- 0
- Radical
- 214
- Omega Function (Ω)
- 5
- 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
- 104
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- Place n equally-spaced points around a circle and join every pair of points by a chord; this divides the circle into a(n) regions.at n=15A006533
- Number of nonsplit type 2 metacyclic 2-groups of order 2^n.at n=51A007981
- Coordination sequence T3 for Zeolite Code BRE.at n=27A008060
- Coordination sequence T6 for Zeolite Code MTT.at n=26A008194
- Poupard's triangle: triangle of numbers arising in enumeration of binary trees.at n=19A008301
- Poupard's triangle: triangle of numbers arising in enumeration of binary trees.at n=21A008301
- Expansion of tan(sin(log(1+x))).at n=7A009656
- Number of subsets of { 1, ..., n } containing an A.P. of length 7.at n=15A018792
- Fibonacci sequence beginning 2, 18.at n=11A022371
- n-th 8k+3 prime plus n-th 8k+5 prime.at n=39A022763
- Number of partitions of n into 5 unordered relatively prime parts.at n=40A023025
- a(n) = position of n^3 + (n+1)^3 in A024670 (distinct sums of cubes of distinct positive integers).at n=49A024674
- a(n) = least m such that if r and s in {1/1, 1/2, 1/3, ..., 1/n} satisfy r < s, then r < k/m < (k+1)/m < s for some integer k.at n=31A024833
- 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+3)/m < s for some integer k.at n=15A024844
- a(n) = Sum_{k=2..n} k*floor(n/k).at n=44A024917
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Fibonacci numbers), t = (F(2), F(3), F(4), ...).at n=11A025082
- Sum of the numbers between the two n's in A026362.at n=21A026365
- a(n) = Sum_{k=0..n} (k+1) * A026725(n, k).at n=8A027211
- 1 together with numbers of the form p*q^4 and p^9, where p and q are distinct primes.at n=36A030628
- [ exp(13/15)*n! ].at n=5A030909