11923
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 11924
- Proper Divisor Sum (Aliquot Sum)
- 1
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11922
- Möbius Function
- -1
- Radical
- 11923
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 50
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1428
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Number of partitions of n in which no parts are multiples of 3.at n=45A000726
- Number of partitions of n into parts not of the form 23k, 23k+10 or 23k-10. Also number of partitions with at most 9 parts of size 1 and differences between parts at distance 10 are greater than 1.at n=34A035998
- Discriminants of imaginary quadratic fields with class number 13 (negated).at n=31A046010
- Numbers n such that n and n+4^k are all primes for k=1,2,3.at n=27A049493
- Number of trees with n nodes and 4 leaves.at n=36A055291
- Initial term in sequence of four consecutive primes separated by 3 consecutive differences each <=6 (i.e., when d=2,4 or 6) and forming d-pattern=[4, 6,6]; short d-string notation of pattern = [466].at n=16A078852
- Primes p such that the differences between the 5 consecutive primes starting with p are (4,6,6,2).at n=7A078956
- Primes p such that p + 2^2, p + 4^2 and p + 6^2 are also primes.at n=21A092475
- Prime(p)-4 for primes p such that prime(p) - 4 is prime.at n=31A094069
- Primes prime(k) such that (prime(k-1) + prime(k+1) + prime(k+2))/prime(k) = 3.at n=20A094933
- Expansion of 1/sqrt(1-2x-11x^2+12x^3).at n=8A098478
- Positive integers not appearing in sequence A098572, which calculates the values of floor(sum(m^(1/m),n=1..m)).at n=44A098573
- Number of partitions of 2n in which each odd part has even multiplicity and each even part has odd multiplicity.at n=25A100847
- Indices of primes in sequence defined by A(0) = 17, A(n) = 10*A(n-1) - 43 for n > 0.at n=12A102010
- Primes p such that 2*p-27, 2*p+27, 2*p-33 and 2*p+33 are primes or -1 times primes.at n=22A103807
- a(n) = 8 + floor( (1 + Sum_{j=1..n-1} a(j)) / 2).at n=18A120137
- a(n) = 2 + floor((1 + Sum_{j=1..n-1} a(j))/5).at n=48A120171
- a(n) = gcd(a(n-1),n-1)*a(n-1) + d(n-1) if a(n-1) is not divisible by 2, otherwise a(n) = a(n-1)/2, where gcd denotes common divisor, d(n) is number of divisors of n.at n=44A133904
- Primes in A023108(n); or Lychrel primes.at n=27A135316
- Primes congruent to 9 mod 37.at n=40A142118