11758
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 17640
- Proper Divisor Sum (Aliquot Sum)
- 5882
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5878
- Möbius Function
- 1
- Radical
- 11758
- 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
- 81
- 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
- yes
- Odd
- no
Appears in sequences
- Dimension of the space of weight n cuspidal newforms for Gamma_1( 95 ).at n=36A063368
- Column 6 of triangle A091602.at n=41A091609
- a(1) = 1, a(2) = 2; for n >= 2, a(n+1) = a(n) + sum of the unique prime factors of a(n).at n=19A096460
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, 0), (-1, 1, 1), (1, 0, -1), (1, 0, 0)}.at n=9A148660
- a(n) is the least integer such that the iterated modulus chain m_1=mod(a(n),m),m_2=mod(a(n),m_1),m_3=mod(a(n),m_2),..., m_n= (0 or 1) reaches a length n. The companion value m, associated to a(n), is given in A177968.at n=26A177967
- Numbers k such that (10^(2k+1) + 12*10^k - 1)/3 is prime.at n=12A183176
- Number of 4-step E, S, NW and NE-moving king's tours on an n X n board summed over all starting positions.at n=15A187587
- a(n+1) is the sum of a(n) and the prime factors of a(n), counted with multiplicity. Start with a(0) = 3.at n=17A192896
- Triangle of coefficients of polynomials u(n,x) jointly generated with A210202; see the Formula section.at n=50A210201
- Number of (w,x,y,z) with all terms in {1,...,n} and w*x>=3*y*z.at n=15A211919
- Numbers k such that 9^k - k is prime.at n=5A224506
- Irregular triangle read by rows: T(n,k) = number of ways k brooks (0 <= k <= 2n+1) can be placed on the grid points of an n triboard so that no two brooks lie in the same straight line.at n=23A260333
- a(n) = (36*n^6 - 60*n^5 + 30*n^4 + 4*n^3 + 8*n^2 - 4*n + 1 - (-1)^n)/8.at n=4A260334
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 326", based on the 5-celled von Neumann neighborhood.at n=37A271261
- Number of odd parts in the partitions of n into 6 parts.at n=46A309549
- Number of rooted trees with n nodes such that no more than four subtrees of the same size extend from the same node.at n=13A318798
- Number of rooted trees with n nodes such that no more than four isomorphic subtrees extend from the same node.at n=13A318851
- Number of distinct integer partitions whose parts can be combined together using additions and multiplications to obtain n, with the exception that 1's can only be added and not multiplied with other parts.at n=26A319913
- Numbers m > 3 such that m-1, m, m+1 belong to A307002.at n=39A340748
- Number of compositions (ordered partitions) of n into at most 6 nonprime parts.at n=36A347799