11958
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 23928
- Proper Divisor Sum (Aliquot Sum)
- 11970
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 3984
- Möbius Function
- -1
- Radical
- 11958
- 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
- 55
- 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
- yes
- Odd
- no
Appears in sequences
- Population of "Triangle" cellular automaton at n-th generation.at n=44A018189
- a(n) = Sum_{k=0..n} (k+1) * A026670(n, k).at n=10A026985
- Numbers which are the sum of their proper divisors containing the digit 9.at n=38A059468
- Values of m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,51.at n=4A064262
- Numbers m such that N = (am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,67.at n=0A065701
- Index of the first occurrence of prime(n) in A060324.at n=26A078454
- Number of -n..n arrays x(0..3) of 4 elements with zero sum and no element more than one greater than the previous.at n=34A199848
- The number of subsets of the numbers {1,2,3...,n} consisting of at most 3 elements and at most two of those are even.at n=43A204555
- Trisection of A107926: The least number k such that there are primes p and q with p - q = 6*n+2, p + q = k, and p the least such prime >= k/2.at n=33A234955
- a(n) = p(n+3)-p(n+1), where p(n) = A238825(n).at n=11A238826
- Number of partitions of n such that (number parts having multiplicity 1) is not a part and (number of parts > 1) is a part.at n=47A241512
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 329", based on the 5-celled von Neumann neighborhood.at n=26A271275
- G.f. A(x) satisfies A(x)^2 = A(x^2) / (1 - 2*x)^2 with A(0)=1.at n=13A372957