11606
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 19920
- Proper Divisor Sum (Aliquot Sum)
- 8314
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4968
- Möbius Function
- -1
- Radical
- 11606
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 174
- 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
- Numbers k such that k, k+1, k+2 and k+3 have the same number of divisors.at n=10A006601
- Difference between the number of 7-dimensional partitions of n and an approximation derived from binomial(n,6).at n=8A007330
- If a, b in sequence, so is ab+10.at n=43A009368
- Number of partitions of n with equal nonzero number of parts congruent to each of 2, 3 and 4 (mod 5).at n=56A035591
- Sets of 4 consecutive numbers with equal number of divisors.at n=37A039665
- Triangle read by rows: T(n,k) is the number of deco polyominoes of height n and having k 1-cell columns (0<=k<=n). A deco polyomino is a directed column-convex polyomino in which the height, measured along the diagonal, is attained only in the last column.at n=50A121554
- Triangle of 5-Eulerian numbers.at n=18A144699
- Number of ways to select disjoint subsets out of {1..n} such that their (sorted) element sums give the list of divisors of n.at n=53A164988
- Sphenic numbers (A007304) whose neighbors are sphenic.at n=23A248202
- Number of length 3+1 0..2*n arrays with the sum of the absolute values of adjacent differences equal to 3*n.at n=13A249983
- The number of overpartitions of n into parts congruent to 2, 4, or 5 modulo 6.at n=46A253136
- Number of integer-sided pentagons having perimeter n, modulo rotations but not reflections.at n=35A293822
- Number of ways to select 4 numbers from the set of the first n natural numbers avoiding 3-term arithmetic progressions.at n=22A300760
- Number of nX4 0..1 arrays with every element unequal to 0, 1 or 3 king-move adjacent elements, with upper left element zero.at n=18A303678
- Integers k such that 2^k contains all powers of 2 not exceeding k as substrings.at n=32A372680
- Triangle read by rows: the n-th row gives the least sequence of n consecutive numbers with the same number of divisors.at n=11A376557
- Number of edge cuts in the n-dipyramidal graph.at n=5A377500