11569
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12096
- Proper Divisor Sum (Aliquot Sum)
- 527
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11044
- Möbius Function
- 1
- Radical
- 11569
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 81
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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 partitions of n, with three kinds of 1,2,3 and 4 and two kinds of 5,6,7,...at n=13A000711
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 80 ones.at n=3A031848
- Binomial transform of cosh(sqrt(2)*x)^2.at n=8A084136
- a(n) = Sum{k=1 to n} sigma_{n-k+1}(k), where sigma_m(k) = sum{j|k} j^m.at n=8A108672
- Denominator of the continued fraction convergents of the decimal concatenation of the powers of 2.at n=4A128875
- G.f.: q-cosh(x) evaluated at q=-x.at n=41A198201
- Numbers k such that 2*k!!! - 1 is prime.at n=26A217650
- Composite numbers k such that if k = a U b (where U denotes concatenation) then a' + b' = k', where a', b' and k' are the arithmetic derivatives of a, b and k.at n=8A239724
- Least number k > 0 such that 3^k begins with exactly n consecutive decreasing digits.at n=4A244851
- Odd numbers k such that phi(k) and cototient(k) have the same prime signature.at n=13A280927
- Composite numbers k = concat(MSD(k),x) such that k' = x', where k' is the arithmetic derivative of k.at n=6A293477
- Composite numbers k = concat(MSD(k),x) such that the sum of the aliquot parts of k is equal to the sum of the aliquot parts of x.at n=5A293479
- Expansion of (1/x) * Series_Reversion( x / ((1+x)^2 * B(x)) ), where B(x) is the g.f. of A002293.at n=5A381909