11585
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 15936
- Proper Divisor Sum (Aliquot Sum)
- 4351
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7920
- Möbius Function
- -1
- Radical
- 11585
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 50
- 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
- Number of 5-tuples of different integers from [ 2,n ] with no common factors among triples.at n=22A015649
- Powers of sqrt(2) rounded down.at n=27A017910
- Powers of sqrt(2) rounded to nearest integer.at n=27A017911
- Powers of sqrt(8) rounded down.at n=9A017928
- Powers of sqrt(8) rounded to nearest integer.at n=9A017929
- Powers of fourth root of 2 rounded down.at n=54A018048
- Powers of fourth root of 8 rounded down.at n=18A018066
- Powers of fourth root of 8 rounded to nearest integer.at n=18A018067
- Nearest integer to n^(9/2).at n=8A036494
- Numbers n such that 159*2^n-1 is prime.at n=23A050831
- a(n) = A017911(n+1) = round(sqrt(2)^(n+1)).at n=26A057048
- Numbers k such that k divides the numerator of B(2k) (the Bernoulli numbers), but gcd(3k, 8^k+1) > 3.at n=26A070192
- a(n) = floor( geometric mean of n-th row of A075363).at n=7A075364
- a(0)=1, a(n+1) = 2*a(n) + b(n+2), where b(n)=A004539(n) is the n-th bit in the binary expansion of sqrt(2).at n=13A084188
- Reduced numerators in Wolfram's iteration for sqrt(2).at n=14A095805
- Reduced numerators in Wolfram's iteration for sqrt(2).at n=15A095805
- Reduced numerators in Wolfram's iteration for sqrt(2).at n=16A095805
- a(0) = a(1) = 0; for n >= 2, a(n) = floor(sqrt(2^(n-2)-1)).at n=29A116601
- Integers n such that n^2 + k is a Mersenne number 2^m - 1 for some k < n and m odd.at n=8A144932
- Numbers k such that 2^k + 27 is prime.at n=33A157007