14766
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 31104
- Proper Divisor Sum (Aliquot Sum)
- 16338
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4664
- Möbius Function
- 1
- Radical
- 14766
- 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
- 71
- 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
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite RSN = RUB-17 K4Na12[Zn8Si28O72].18H2O starting with a T3 atom.at n=13A019221
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 80.at n=35A031578
- Numbers whose maximal base-9 run length is 4.at n=31A037999
- Numbers having four 2's in base 9.at n=13A043464
- Numbers whose base-11 representation has exactly 5 runs.at n=3A043648
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 2 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 3.at n=31A050035
- Numbers k such that k^2 contains exactly 9 different digits.at n=21A054037
- Sum of all numbers from 2*n-1 up to prime(n).at n=42A161626
- Number of n X 2 0..3 arrays with rows and columns lexicographically nondecreasing read forwards and nonincreasing read backwards.at n=33A201975
- Least k such that k*30^n-1 , k*30^n+1, and 2*k*30^n-1 are prime; that is, twin primes and a Sophie Germain prime.at n=26A212956
- Initial members of abundant quadruplets, i.e., values of k such that (k, k+2, k+4, k+6) are all abundant numbers.at n=26A231089
- Number of ways to place non-intersecting diagonals in a convex (n+2)-gon so as to create no pentagons.at n=7A253194
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 118", based on the 5-celled von Neumann neighborhood.at n=33A270187
- Erroneous version of A271811 (but for odd primes only).at n=16A271664
- Expansion of Product_{k>=1} 1/((1 - x^k)*(1 - x^(5*k))).at n=32A318028
- Number of n-th generation nodes of a rooted binary tree whose m-th node has exactly A000002(m) descendants, where A000002 is the Kolakoski sequence.at n=24A329758
- a(1) = 2; for n > 1, a(n) = 3*a(n-1) + 3 - n.at n=8A353094
- Number of graph minors in the cycle graph C_n.at n=24A353206
- G.f.: Sum_{n>=0} x^(n*(n+1)/2) * P(x)^n, where P(x) is the partition function (A000041).at n=18A356507
- Array read by ascending antidiagonals: A(1, k) = k; for n > 1, A(n, k) = (k + 1)*A(n-1, k) + k + 1 - n, with k > 0.at n=46A363365