11557
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 14336
- Proper Divisor Sum (Aliquot Sum)
- 2779
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9072
- Möbius Function
- -1
- Radical
- 11557
- 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
- 143
- 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
- Pseudoprimes to base 20.at n=33A020148
- Pseudoprimes to base 24.at n=39A020152
- Pseudoprimes to base 90.at n=21A020218
- Strong pseudoprimes to base 22.at n=8A020248
- Strong pseudoprimes to base 75.at n=22A020301
- Strong pseudoprimes to base 90.at n=7A020316
- a(n) = least m such that if r and s in {F(h)/F(2*h): h = 1,2,...,n} satisfy r < s, then r < k/m < s for some integer k, where F = A000045 (Fibonacci numbers).at n=18A024831
- Number of series-reduced dyslexic planted compound windmills with n leaves of 2 colors with no symmetries.at n=9A032259
- Number of (odd and even) split numbers (A036382) below 2^n.at n=13A036389
- a(n) = p^2 + p + 1 where p runs through the primes.at n=27A060800
- Number of ordered triples (a, b, c) with gcd(a, b, c) = 1 and 1 <= {a, b, c} <= n.at n=23A071778
- Smallest number k such that there are exactly n relatively prime numbers using all digits of k.at n=25A075604
- n+sigma(n)+sigma(sigma(n)) is a triangular number.at n=40A116015
- Where records occur in A001917.at n=16A152597
- 7 times heptagonal numbers: a(n) = 7*n*(5*n-3)/2.at n=26A152777
- Products of three distinct primes of the form 6*k + 1.at n=24A154729
- Number of nodes (or order) of a graph model obtained using an automata scheme on sets of order prime(n) >= 5 and in which all not halt states are linked by arcs (edges).at n=26A160772
- Number of (n+2) X 6 0..2 arrays with every 3 X 3 subblock commuting with each horizontal and vertical neighbor 3 X 3 subblock.at n=4A186563
- Number of (n+2) X 7 0..2 arrays with every 3 X 3 subblock commuting with each horizontal and vertical neighbor 3 X 3 subblock.at n=3A186564
- T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with every 3X3 subblock commuting with each horizontal and vertical neighbor 3X3 subblock.at n=31A186568