11535
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
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 18480
- Proper Divisor Sum (Aliquot Sum)
- 6945
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6144
- Möbius Function
- -1
- Radical
- 11535
- 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
- 55
- 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
- a(n) = Sum_{k=1..n} k*phi(k).at n=37A011755
- Sixth column of triangle A055584.at n=6A055586
- a(n) = floor(n^3/9).at n=47A061263
- Numbers k such that numerator(Bernoulli(2*k)/(2*k)) is different from numerator(Bernoulli(2*k)/(2*k*(2*k-1))).at n=44A090495
- Lucky numbers for which both the sum of the digits and the product of the digits is also a lucky number.at n=20A118559
- Numbers of the form 86+p^2 (where p is a prime).at n=27A138692
- The maximum integer dimension in which the volume of the hypersphere of radius n remains larger than 1.at n=25A177677
- Triangle read by rows: T(n,k) is the number of 2-compositions of n having k nonzero entries in the top row. A 2-composition of n is a nonnegative matrix with two rows, such that each column has at least one nonzero entry and whose entries sum up to n.at n=48A181332
- Riordan array T((1-x)^(-2) | 2x-1) read by rows.at n=48A181690
- a(n) = a(n-1) + a(n-2) + n + 2 with n>1, a(0)=1, a(1)=2.at n=16A210728
- Number of (w,x,y) with all terms in {0,...,n} and w != min(|w-x|, |x-y|).at n=22A213499
- Number of numbers k in interval [(p_n)^2+1, (p_n)^4] for which lpf(k-1)>lpf(k-3)>=p_n, such that {k-3, k-1} is not a pair of twin primes, where p_n=prime(n) and lpf = A020639.at n=8A243804
- The decimal digits of n appear n times in the decimal representation of n!.at n=7A264688
- Irregular triangle read by rows: T(n,k) is the number of n X n tic-tac-toe positions (up to rotation and reflection) with k tokens (i.e., after k plays) which allow a winning strategy for X (n > 0, 0 <= k <= n^2).at n=26A317573
- a(n) = Sum_{k=1..n} k * tau_3(k), where tau_3 is A007425.at n=42A318750
- Number of compositions of n such that the difference between adjacent parts is at least two.at n=23A332829
- a(n) is the number of 4 element sets of distinct integer sided strict rectangles that fill an n X n square.at n=29A384724
- Smallest number obtained by concatenating a permutation of the divisors of n.at n=14A390599