14774
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 22680
- Proper Divisor Sum (Aliquot Sum)
- 7906
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7216
- Möbius Function
- -1
- Radical
- 14774
- 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
- 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
- Sums of distinct powers of 11.at n=23A033047
- Values of A038007 not ending in 6 or 8.at n=31A038009
- a(n) = 2*prime(n)*prime(n+1).at n=22A069486
- Indices of the primes p for which the number of representations of p as the sum of a perfect prime power (A025475: q^e with e>1) and an integer k which is less than q exceeds one.at n=2A136335
- Number of binary words of length n containing at least one subword 10^{9}1 and no subwords 10^{i}1 with i<9.at n=54A143289
- a(n) = numerator of constant lambda(n) involved in a recurrence for the Atkin polynomials A_k(j).at n=14A145226
- Table, read by antidiagonals, in which the n-th row comprises A214206(n) in position 0 followed by a second order recursive series G in which each product G(i)*G(i+1) lies in the same row of A001477 (interpreted as a square array).at n=38A182440
- Kochański's (or Kochanski's) sequence.at n=3A191642
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 443", based on the 5-celled von Neumann neighborhood.at n=26A272227
- a(n) = a(n-1) + 3*a(n-2) -2*a(n-3) - 2*a(n-4), where a(0) = -2, a(1) = -1, a(2) = 2, a(3) = 1.at n=17A295853
- Expansion of Product_{k>=2} (1 + x^k)/(1 - x^k).at n=30A300415
- Squarefree numbers k such that the sum of the distinct prime factors of k is twice the difference between the largest and the smallest prime factors of k.at n=17A324210
- Numbers whose digits are in nondecreasing order in bases 8 and 9.at n=49A329298
- a(1) = 12; for n >= 2, a(n) = least positive integer of the form prime(m)*prime(n-m)*prime(n) with m >= 1.at n=23A364434
- Numbers whose binary expansion consists of alternating runs of 1's and 0's where each run of 0's is exactly one shorter than the preceding run of 1's, and the expansion ends with a 0-run.at n=31A387270