11559
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 15416
- Proper Divisor Sum (Aliquot Sum)
- 3857
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7704
- Möbius Function
- 1
- Radical
- 11559
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 130
- 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
- T(n,n-3), array T as in A054106.at n=40A054107
- a(n) = A058094(n) - 3*A058094(n-1) + A058094(n-2) for n >=4.at n=10A092490
- Numbers of the form 110 + p^2. (where p is a prime).at n=27A138693
- a(n) = n^3 + sum((-1)^j*a(j)); for j=1 to n-1; a(1)=1.at n=36A153286
- a(n) = 289*n - 1.at n=39A158253
- a(n) = 10*n^2 - 1.at n=33A158447
- a(n) = 40*n^2 - 1.at n=16A158598
- Partial sums of A024785.at n=41A173060
- Parameters n for which the elliptic curve y^2=x^3-n has rank 4.at n=11A179137
- Number of 0..n arrays x(0..3) of 4 elements with nondecreasing average value and 0..n occur with instance counts within one of each other.at n=17A200943
- Number of 3-element subsets of {1,...,n} whose sum has more than 3 divisors.at n=45A241564
- a(n) is the smallest k such that in the interval [1,k] of sequence A242034 all odd primes <= prime(n) are present.at n=42A242037
- a(n) is the smallest k such that in the interval [1,k] of sequence A242034 all odd primes <= prime(n) are present.at n=43A242037
- Semiprimes sp of the form p^2 + q + 1 where p and q are consecutive primes.at n=12A242243
- Main diagonal of Unlucky array: a(n) = A255543(n,n).at n=20A255549
- Smallest positive integer m such that (m^(2^n) + 1)/2 is prime.at n=17A275530
- Numbers k such that k!6 - 8 is prime, where k!6 is the sextuple factorial number (A085158).at n=40A289686
- Numbers k such that f(k), f(k+1) and f(k+2) are all primes, where f(k) = (2k+1)^2 - 2 (A073577).at n=41A293620
- Expansion of Product_{k>=1} 1/(1 - x^(k^2))^A037444(k).at n=50A320846
- Number of pairs of adjacent equal parts in all gap-free compositions of n.at n=14A380176