11715
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 20736
- Proper Divisor Sum (Aliquot Sum)
- 9021
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5600
- Möbius Function
- 1
- Radical
- 11715
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- Numbers k such that phi(k) = phi(k+1).at n=18A001274
- Numbers whose sum of divisors is a fourth power.at n=27A019422
- Number of compositions of n into positive triangular numbers.at n=23A023361
- (d(n)-r(n))/5, where d = A006527 and r is the periodic sequence with fundamental period (4,1,4,0,1).at n=54A026036
- Smallest composite that when added to sum of prime factors reaches a prime after n iterations.at n=34A050710
- Numbers that are the products of distinct substrings (>1) of themselves and do not end in 0.at n=15A059470
- Squarefree numbers k such that phi(k) = phi(k+1).at n=10A063739
- Sum of terms in n-th group in A075352.at n=46A075356
- Smallest a(n)>a(n-1) such that a(n)^2+a(n-1)^2 is a perfect square, a(1)=6.at n=29A076672
- Smallest a(n)>a(n-1) such that a(n)^2+a(n-1)^2 is a perfect square, a(1)=7.at n=25A076673
- Smallest a(n)>a(n-1) such that a(n)^2+a(n-1)^2 is a perfect square, a(1)=10.at n=25A076675
- Smallest a(n)>a(n-1) such that a(n)^2+a(n-1)^2 is a perfect square, a(1)=11.at n=23A076676
- Number of partitions of n into parts having at most two prime-factors.at n=35A101049
- a(n) = a(n - 1) - 2*a(n - 2) + a(n - 3) - 2*a(n - 4) + a(n - 5).at n=40A122582
- A doubly-fractal sequence. Erase the first (leftmost) digit of every integer: what is left is the sequence itself. The erased digits, one by one, form also the sequence itself.at n=40A127274
- a(n) = 8*a(n-1)-a(n-2) with a(0)=0 and a(1)=3.at n=5A136325
- A number n is included in the sequence if and only if the n-th integer from among those positive integers which are coprime to n+1 = the (n+1)-st integer from among those positive integers which are coprime to n.at n=7A139766
- Numerators in continued fraction expansion of sqrt(3/5).at n=9A145542
- Number of walks within N^2 (the first quadrant of Z^2) starting and ending at (0,0) and consisting of n steps taken from {(-1, 0), (-1, 1), (0, 1), (1, -1)}.at n=15A151335
- a(n) = (2*n^3 + 5*n^2 - 13*n)/2.at n=21A162262