14660
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 30828
- Proper Divisor Sum (Aliquot Sum)
- 16168
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5856
- Möbius Function
- 0
- Radical
- 7330
- Omega Function (Ω)
- 4
- 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
- 45
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- Bisection of A002470.at n=32A002286
- Sum of 10 nonzero 8th powers.at n=27A003388
- Sum{T(i,n-i): i=0,1,...,n}, array T as in A047110.at n=15A047111
- Numbers which are the sum of their proper divisors containing the digit 3.at n=1A059462
- Number of regions formed inside square by diagonals and the segments joining the vertices to the points dividing the sides into n equal length segments.at n=29A108914
- Number of permutations of length n which avoid the patterns 231, 12354.at n=10A116850
- Low point in segment n of A079051.at n=44A117518
- Number of -n..n arrays x(0..3) of 4 elements with zero sum, adjacent elements differing by more than one, and elements alternately increasing and decreasing.at n=18A200193
- Number of (n+1) X (n+1) 0..3 arrays with nondecreasing min(x(i,j),x(i,j-1)) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=1A250511
- Number of (n+1)X(2+1) 0..3 arrays with nondecreasing min(x(i,j),x(i,j-1)) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=1A250513
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with nondecreasing min(x(i,j),x(i,j-1)) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=4A250519
- Position of the n-th prime in A253279.at n=43A255999
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 742", based on the 5-celled von Neumann neighborhood.at n=43A273484
- Numbers m > 0 that have a divisor d > 1 with binomial(m+d, d) == 1 mod m.at n=23A290040
- a(n) is the least positive even number k such that among the first k prime numbers there are exactly k/2 prime numbers where the n-th least significant bit is one, or a(n) = -1 if no such k exists.at n=10A308575
- Sum over all permutations of [n] of the minimum of the lengths of longest increasing subsequence and longest decreasing subsequence.at n=6A321274
- Squares where A323809 gets stuck.at n=12A323813
- Number of regions among all distinct circles that can be constructed from a point on the origin and n equally spaced points on each of the +x,-x,+y,-y coordinates axes when each pair of points is connected by a circle and where the points lie at the ends of the circles' diameter.at n=4A362234
- Sum of the n-th maximal antirun of odd primes differing by more than two.at n=30A373405