10713
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 14288
- Proper Divisor Sum (Aliquot Sum)
- 3575
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7140
- Möbius Function
- 1
- Radical
- 10713
- 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
- 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
- a(n) = floor(n*phi^17), where phi is the golden ratio, A001622.at n=3A004932
- a(n) = round(n*phi^17), where phi is the golden ratio, A001622.at n=3A004952
- Main diagonal of Wythoff array: w(n,n)=[ n*tau ]F(n+1)+(n-1)F(n), where tau=(1+sqrt(5))/2, F(n) = Fibonacci numbers.at n=12A020941
- Fibonacci sequence beginning 3, 9.at n=16A022379
- a(n) = p^2 + p + 1 where p runs through the primes.at n=26A060800
- a(n) = F(F(n+1)) - F(F(n)), where F() = Fibonacci numbers.at n=7A113597
- Denominators of an Egyptian fraction for 1/Sqrt[28] = 0.1889822365...at n=2A145002
- Let T be the sequence Fibonacci(2n+1), n>=0 (cf. A001519); sequence lists the differences T(j)-T(i) for i<j.at n=48A169691
- [s(k)-s(j)]/7, where the pairs (k,j) are given by A205862 and A205863, and s(k) denotes the (k+1)-st Fibonacci number.at n=36A205865
- Number of (w,x,y) with all terms in {0,...,n} and 2|w-x| >= max(w,x,y)-min(w,x,y).at n=24A213388
- Numbers arising in computing the Turan function of cycles of length 4.at n=27A217004
- Numbers n such that Q(sqrt(n)) has class number 7.at n=37A218039
- Fundamental discriminants of real quadratic number fields with class number 7.at n=25A218157
- Number of n X 2 0,1 arrays indicating 2 X 2 subblocks of some larger (n+1) X 3 binary array having a sum of three or less, with rows and columns of the latter in lexicographically nondecreasing order.at n=21A227265
- Length of period of Narayana sequence A000930 modulo n-th prime.at n=26A271901
- Number of partitions of n having an integer median.at n=33A325347
- G.f.: Sum_{n>=0} (n+1) * x^n * (1 + x^n)^n.at n=64A326002
- Moduli a(n) = v(n) for the simple difference sets of Singer type of order m(n) (v(n), m(n)+1, 1) in the additive group modulo v(n) = m(n)^2 + m(n) + 1, with m(n) = A000961(n).at n=37A335865
- Sum of the divisors of A000073(n) (tribonacci numbers).at n=16A366783
- Squarefree numbers of the form k^2 + k + 1 such that k^2 + k + 2 is also squarefree.at n=46A368084