11658
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 24480
- Proper Divisor Sum (Aliquot Sum)
- 12822
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3696
- Möbius Function
- 1
- Radical
- 11658
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 37
- 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
- Coordination sequence for MgNi2, Position Ni1.at n=27A009933
- A generalized difference set on the set of all integers (lambda = 2).at n=23A049399
- Permutation rooted trees with n nodes.at n=9A050383
- Truncated triangular pyramid numbers: a(n) = (n-5)*(n^2 + 8*n - 66)/6.at n=35A051939
- Numbers k such that 1/(1/phi(k) + 1/phi(k+1) + 1/phi(k+2) + 1/phi(k+3)) is an integer.at n=12A073544
- Sums of rows of the triangle in A116366.at n=41A116367
- 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, 0, -1), (1, -1, 0), (1, 1, 0), (1, 1, 1)}.at n=7A150906
- Number of nondecreasing integer sequences of length 7 with sum zero and sum of absolute values 2n.at n=20A158141
- a(n) = 36*n^2 - 6.at n=17A158462
- Numbers k such that 6^7 + k^2 is a square.at n=19A180971
- Sum of the parts of all partitions of n-1 plus the sum of the emergent parts of the partitions of n.at n=19A182707
- Integers k such that for all i > k the largest prime factor of i(i+1)(i+2)(i+3)(i+4)(i+5)(i+6) exceeds the largest prime factor of k(k+1)(k+2)(k+3)(k+4)(k+5)(k+6).at n=14A193948
- a(n) = 14*n^2 - 4*n.at n=29A195023
- Number of tilings of a 4 X n rectangle using L and Z tetrominoes.at n=11A232497
- Numbers k with the property that p = k^2 - 13 and q = k^2 + 13 are consecutive primes.at n=24A248785
- Array read by antidiagonals: T(n,m) = number of directed Hamiltonian walks from NW to SW corners on a grid with n rows and m columns.at n=71A271592
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 525", based on the 5-celled von Neumann neighborhood.at n=22A272740
- Number of directed Hamiltonian walks from NW to SW corners of a 6 X n grid.at n=6A333602
- Row sums of A364891.at n=40A364892