11526
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
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 24624
- Proper Divisor Sum (Aliquot Sum)
- 13098
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3584
- Möbius Function
- 1
- Radical
- 11526
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 37
- 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
- yes
- Odd
- no
Appears in sequences
- Number of partitions of floor(5n/2)-1 into n nonnegative integers each no more than 5.at n=36A001976
- a(n) = (2*n+1)*(9*n+1).at n=25A033573
- Denominators of continued fraction convergents to sqrt(537).at n=11A042027
- Denominators of continued fraction convergents to sqrt(594).at n=7A042139
- Numbers m such that N = (am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,53.at n=1A065695
- Difference between A007678(2n)/(2n) and (n-1)^2.at n=34A085611
- Number of 3 X n (0,1) matrices such that each row and each column is nondecreasing or nonincreasing.at n=16A086113
- Numbers n such that 4*10^n + 5*R_n + 4 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=12A102993
- Number of compositions of n when each even part can be of two kinds.at n=12A105476
- Number of rooted trees with n generators.at n=8A108521
- Sum of staircase twin primes according to the rule: top * bottom - next top.at n=9A135285
- -10-Knödel numbers.at n=45A225514
- Composite squarefree numbers n such that p(i)-10 divides n+10, where p(i) are the prime factors of n.at n=26A225710
- Numbers n such that the sum of the numbers in the Collatz (3x+1) iteration of n is a perfect square.at n=31A225866
- a(n) = ( 2*n*(2*n^2 + 11*n + 26) - (-1)^n + 1 )/16.at n=34A256666
- Number of 4Xn arrays containing n copies of 0..4-1 with every element equal to or 1 greater than any west, northeast or northwest neighbors modulo 4 and the upper left element equal to 0.at n=12A267426
- Triangle read by rows: T(n,k) = number of times the value k appears on the parking functions of length n.at n=19A298593
- Expansion of Product_{n>=1} ((1 - (4*x)^n)/(1 + (4*x)^n))^(1/4).at n=8A303394
- Number of distinct pairs (m, y), where m >= 1 and y is an integer partition of n, such that m can be obtained by iteratively adding any two or multiplying any two non-1 parts of y until only one part (equal to m) remains.at n=14A319912
- Numbers k such that A338338(k) is a prime p that ends a run of three terms in A338338 that are divisible by p.at n=34A338344