11926
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
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 18360
- Proper Divisor Sum (Aliquot Sum)
- 6434
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5808
- Möbius Function
- -1
- Radical
- 11926
- 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
- 50
- 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
- Second pentagonal numbers with odd index: a(n) = (2*n-1)*(3*n-1).at n=45A033568
- Number of partitions satisfying cn(0,5) + cn(2,5) <= cn(1,5) + cn(4,5) and cn(0,5) + cn(3,5) <= cn(1,5) + cn(4,5).at n=35A039887
- A089450 indexed by A000040.at n=5A089525
- Numbers n such that for some k and a_1,a_2,...,a_k the concatenation of the a_i is equal to n and their product is equal to pi(n).at n=36A097221
- Expansion of x^9/((1-x)*(1-x^2)*(1-x^3))^2.at n=29A117485
- T(n, k) = 3*T(n-1, k-1) + T(n-1, k) for k < n and T(n, n) = 1, T(n, k) = 0, if k < 0 or k > n; triangle read by rows.at n=59A119673
- a(1)=a(2)=1. a(n+1) = a(n) + a(largest prime dividing n).at n=39A128215
- Size of the BDD for the hidden weighted bit function, with the variables in their natural ordering.at n=24A136445
- Triangular array: the fission of the polynomial sequence ((x+1)^n: n >= 0) by the polynomial sequence ((x+2)^n: n >= 0). (Fission is defined at Comments.)at n=49A193842
- Mirror image of the triangle A193842.at n=50A193843
- Number of length n+4 0..5 arrays with every five consecutive terms having two times the sum of some three elements equal to three times the sum of the remaining two.at n=10A248984
- Numbers k such that sigma(k) = sigma(k - d(k)).at n=24A277273
- a(n) is the number of permutations of length n that avoid the pattern 321 and the mesh pattern (12, 363) or the same sequence for the mesh patterns (12, 399), (12, 429), (12, 483).at n=10A289598
- G.f.: Im((2*i; x)_oo), where (a; q)_oo is the q-Pochhammer symbol, i = sqrt(-1).at n=39A292140
- Number of integer partitions of n whose product is a multiple of n + 1.at n=41A379320