14835
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
- 25344
- Proper Divisor Sum (Aliquot Sum)
- 10509
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7392
- Möbius Function
- 1
- Radical
- 14835
- 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
- 120
- 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
- no
- Odd
- yes
Appears in sequences
- Number of n-node trees with a forbidden limb of length 4.at n=16A002990
- A000041(n) - A000203(n).at n=34A086738
- Numbers k such that k and 2*k, taken together are pandigital.at n=5A115922
- Primitive elements of A119432.at n=31A119433
- Numbers k such that 2*k+1, 4*k+1, 8*k+1 and 16*k+1 are primes.at n=15A124412
- Sequence defined by the recurrence formula a(n+1)=sum(a(p)*a(n-p)+k,p=0..n)+l for n>=1, with here a(0)=1, a(1)=0, k=-1 and l=-1.at n=11A176952
- Products p*q*r*s of distinct primes for which (p*q*r*s - 1)/2 is prime.at n=29A234498
- Number of partitions p of n such that (maximal multiplicity of the parts of p) >= (number of distinct parts of p).at n=38A240308
- Number of simple connected graphs with n nodes that are non-integral and have no subgraph isomorphic to the bowtie graph.at n=8A243549
- Rounded down ratio of a minimum intersection area with a unit circle area in n-symmetrical unit circles intersect in a single point.at n=26A243933
- a(n) = Sum_{k=1, n} phi(k)*index(k, n), with phi(k) the Euler totient A000010(k) and index(k,n) the position of 1/k in the n-th row of the Farey sequence of order k, A049805(n,k).at n=45A244396
- Expansion of Product_{i>=2, j>=2} 1 / (1 - x^(i*j))^j.at n=35A326830
- Number of permutations sigma of [n] such that (sigma(k) mod sigma(k+1)) <= (sigma(k+1) mod sigma(k+2)) for 1 <= k <= n - 2.at n=13A332800
- G.f. A(x) satisfies A(x) = (1 + x*A(x)^2 / (1+x))^3.at n=5A371538