14761
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 15300
- Proper Divisor Sum (Aliquot Sum)
- 539
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 14224
- Möbius Function
- 1
- Radical
- 14761
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 133
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n+1-k), where k = [ (n+1)/2 ], s = (F(2), F(3), ...).at n=15A024591
- a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n-k+1), where k = [ n/2 ], s = (F(2), F(3), F(4), ...).at n=14A025105
- Numbers whose maximal base-9 run length is 4.at n=27A037999
- Denominators of continued fraction convergents to sqrt(930).at n=4A042799
- Numbers having four 2's in base 9.at n=9A043464
- Centered 18-gonal numbers.at n=40A069131
- Partial sums of A080925.at n=9A080926
- Numbers of the form k^2 - k - 1 whose digit sum is also a number of the form k^2 - k - 1.at n=42A117746
- Partial sums of A132357.at n=9A135266
- (9^n - 5) / 4.at n=4A211866
- E.g.f. satisfies: A'(x) = A(x)^6 * A(-x) with A(0) = 1.at n=5A235371
- Number of partitions of n such that (maximal multiplicity of parts) > (multiplicity of the least part).at n=41A240304
- Sum of the largest parts in the partitions of n into 6 parts.at n=35A308873
- Number of necklace compositions of n with distinct multiplicities.at n=19A325550
- a(0) = 0, a(1) = 1; a(2*n) = a(n), a(2*n+1) = 9*a(n) + a(n+1).at n=47A342638
- Numbers with two or more distinct prime factors such that the number and all its prime factors fall on a single straight line when they are plotted on a square spiral.at n=39A346294
- a(n) = Sum_{1 <= x_1, x_2 <= n} gcd(x_1, x_2, n)^4.at n=10A372926
- Expansion of e.g.f. exp(x * sqrt(1-x^2)).at n=10A373542