11713
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 13608
- Proper Divisor Sum (Aliquot Sum)
- 1895
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9984
- Möbius Function
- -1
- Radical
- 11713
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 143
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- Pseudoprimes to base 30.at n=45A020158
- Pseudoprimes to base 54.at n=33A020182
- Quasi-Carmichael numbers to base 9: squarefree composites n such that (n,2*3*5*7) = 1 and prime p|n ==> p-9|n-9.at n=3A029554
- Numerator of n*(n-1)*(n-2)/720.at n=53A051726
- At stage 1, start with a unit square. At each successive stage add 4*(n-1) new squares around outside with edge-to-edge contacts. Sequence gives number of squares (regardless of size) at n-th stage.at n=25A056640
- a(n) is the smallest multiple of n such that a(n) mod 100 = n and S(n)=n where S(n) is the sum of the base-ten digits of n, or 0 if no such a(n) exists.at n=12A075154
- Square array read by antidiagonals: T(n,k) = (k*(2*k+3)^n + 1)/(k+1).at n=40A083075
- Fifth row of number array A083075.at n=4A083077
- Main diagonal of number array A083075.at n=4A083080
- c(n) = number of c-nets on n vertices.at n=5A106651
- Number of squares in the interior of the square with vertices (n,0), (0,n), (-n,0) and (0,-n) in a square (x,y)-grid.at n=25A111746
- Zeroless numbers for which the sum of the digits and the product of the digits are both Fibonacci numbers.at n=40A117725
- Multiples of 13 containing a 13 in their decimal representation.at n=33A121033
- Multiples of 17 containing a 17 in their decimal representation.at n=19A121037
- Composite numbers such that the square mean of their prime factors is a nonprime integer (where the prime factors are taken with multiplicity and the square mean of c and d is sqrt((c^2+d^2)/2)).at n=38A134602
- Primitive subsequence of A111105.at n=21A137559
- a(n) = (2*n - 1)*(24*n^2 - 42*n + 19).at n=6A160174
- The function W_n(6) (see Borwein et al. reference for definition).at n=12A169711
- a(n) is the smallest multiple of n such that a(n) ends with n and S(a(n))=n where S(m) is the sum of the base ten digits of m, or 0 if no such a(n) exists.at n=12A187924
- Diagonal sums of number triangle A188474.at n=12A188476