11873
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12288
- Proper Divisor Sum (Aliquot Sum)
- 415
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11460
- Möbius Function
- 1
- Radical
- 11873
- 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
- 99
- 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
- Numbers k such that the continued fraction for sqrt(k) has period 76.at n=36A020415
- Number of partitions of n that do not contain 8 as a part.at n=35A027342
- Number of partitions satisfying cn(2,5) <= cn(0,5) + cn(1,5) + cn(4,5) and cn(3,5) <= cn(0,5) + cn(1,5) + cn(4,5).at n=34A039871
- Numbers whose base-5 representation contains exactly three 3's and three 4's.at n=3A045307
- a(n) = numerator(6 * Sum_{k=2..n} 1/(binomial(2*k, k)*(k-1))).at n=5A145566
- a(n) = prime(n) * prime(n+2) - 2 * prime(n+1).at n=27A152532
- Numbers k such that 3^(2k-3) + 3^(k-1) + 1 is prime.at n=15A199191
- Coefficients in the expansion of ([r^2] + [2r^2]x + [3r^2]x^2 + ...)/([r] + [2r]x + [3r]x^2 + ...); [ ] = floor, r = golden ratio = (1 + sqrt(5))/2.at n=18A279586
- The n-th number m such that a nontrivial prime(n)-th root of unity modulo m exists.at n=42A305828
- Numerator of the expected fraction of occupied places on n-length lattice randomly filled with 2-length segments.at n=8A307131
- Numbers that are the sum of six fifth powers in two or more ways.at n=5A345507
- Numbers that are the sum of six fifth powers in exactly two ways.at n=5A346357
- a(n) = Sum_{k=1..n} (-1)^(k-1) * binomial(floor(n/k)+2,3).at n=41A366395
- Expansion of 1 / ((1-x)^3 - x^2)^2.at n=8A392581