11096
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 22200
- Proper Divisor Sum (Aliquot Sum)
- 11104
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 5184
- Möbius Function
- 0
- Radical
- 2774
- Omega Function (Ω)
- 5
- 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
- 68
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- a(n) = 6*n^2 + 2 for n > 0, a(0)=1.at n=43A005897
- Aliquot sequence starting at 180.at n=16A008891
- Number of partitions of n into parts having a common factor.at n=66A018783
- Multiplicity of highest weight (or singular) vectors associated with character chi_52 of Monster module.at n=36A034440
- Numbers ending with '6' that are the difference of two positive cubes.at n=40A038861
- Numbers k such that sigma(k) == 8 (mod k).at n=7A045770
- Number of 3-bead necklaces where each bead is an unlabeled rooted tree, by total number of nodes.at n=12A059221
- Even and odd solutions to abs(sigma(x)-2x) <= log(x). Numbers n whose abundance-radius does not exceed log(n).at n=36A088011
- Numbers k with abundance radius of 8, i.e., abs(sigma(k)-2*k) = 8.at n=8A088820
- Numbers k whose abundance is 8: sigma(k) - 2*k = 8.at n=3A088833
- Numbers k divisible by their abundance sigma(k) - 2*k.at n=48A097498
- Numbers k such that 10^k*(10^7*(-1+10^k)+6083806) + 10^k - 1 is prime.at n=8A107291
- Admirable numbers whose abundance is < 10.at n=15A109788
- Admirable numbers such that the subtracted divisor is square.at n=10A109806
- Let n = a_1a_2...a_k, where the a_i are digits. a(n) = least multiple of n of the type b_1a_1b_2a_2...a_kb_{k+1}, obtained by inserting single digits b_i in the gaps and both ends; 0 if no such number exists.at n=18A110735
- Main diagonal of square table A112564 of generalized Flavius Josephus sieves.at n=7A112565
- Near-multiperfects with primes excluded, abs(sigma(m) mod m) <= log(m).at n=38A117347
- Near-multiperfects with primes and powers of 2 excluded, abs(sigma(m) mod m) <= log(m).at n=26A117348
- Near-multiperfects with primes, powers of 2 and 6 * prime excluded, abs(sigma(n) mod n) <= log(n).at n=26A117349
- Near-multiperfects with primes, powers of 2, 6 * prime and 2^n * prime excluded, abs(sigma(n) mod n) <= log(n).at n=10A117350