10717
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12256
- Proper Divisor Sum (Aliquot Sum)
- 1539
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9180
- Möbius Function
- 1
- Radical
- 10717
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 29
- 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
- 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 A(A000099(n)).at n=28A000323
- Boustrophedon transform of squares.at n=7A000745
- Perrin sequence (or Perrin numbers, or Ondrej Such sequence): a(n) = a(n-2) + a(n-3) with a(0) = 3, a(1) = 0, a(2) = 2.at n=33A001608
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 52 ones.at n=26A031820
- Gaps of 2 in sequence A038593 (lower terms).at n=15A038643
- Gaps of 5 in sequence A038593 (upper terms).at n=2A038650
- Numbers n such that n | 7^n + 6^n + 5^n + 4^n + 3^n + 2^n + 1^n.at n=39A056750
- Interprimes which are of the form s*prime, s=7.at n=14A075282
- Least number that ends an arithmetic progression of n numbers with the same prime signature.at n=13A087309
- Least number that ends an arithmetic progression of n numbers with the same number of divisors.at n=13A090548
- Smallest semiprime (A001358) which is at the end of an arithmetic progression of n semiprimes.at n=13A096003
- Numbers k such that 2*10^k + 6*R_k - 3 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=19A098959
- Perrin numbers which are divisible by their digital root.at n=14A117959
- Super-Catalan triangle (read by rows) = triangular array associated with little Schroeder numbers (read by rows): T(0,0)=1, T(p,q) = T(p,q-1) if 0 < p = q, T(p,q) = T(p,q-1) + T(p-1,q) + T(p-1,q-1) if -1 < p < q and T(p,q) = 0 otherwise.at n=50A144944
- Partial sums of A028388 good primes (version 2).at n=36A172166
- Magic constants of 5 X 5 magic squares which consist of consecutive primes.at n=39A176571
- Riordan array (s(x),x*S(x)) where s(x) is the g.f. of the little Schroeder numbers A001003, and S(x) is the g.f. of the large Schroeder numbers A006318.at n=49A186826
- a(n) = round(r^n) where r is the smallest Pisot number (real root r=1.3247179.. of x^3-x-1).at n=33A205579
- a(n) = floor(Fibonacci(n)/7).at n=25A214286
- Total number of parts of multiplicity 9 in all partitions of n.at n=41A222709