14785
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 17748
- Proper Divisor Sum (Aliquot Sum)
- 2963
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11824
- Möbius Function
- 1
- Radical
- 14785
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 58
- 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
- Numbers k such that the continued fraction for sqrt(k) has period 93.at n=9A020432
- Numerators of continued fraction convergents to sqrt(821).at n=7A042584
- Numbers whose base-11 representation has exactly 5 runs.at n=11A043648
- Indices n of primes p(n), p(n+4) such that p(n)-1 and p(n+4)-1 have the same largest prime factor.at n=20A105407
- Centered 28-gonal numbers.at n=32A195314
- G.f.: A(x) = exp( Sum_{n>=1} x^n/n * Sum_{k=0..n} binomial(n,k)^2 * x^k*(1-x)^k ).at n=16A217282
- Number of partitions p of n such that max(p)-min(p) = 7.at n=42A218570
- a(n) = Sum_{i=1..n} ( Product_{k|i} d(k) ), where d(n) = A000005(n).at n=30A237349
- Total number of inversions in all partitions of n into distinct parts.at n=42A271371
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 593", based on the 5-celled von Neumann neighborhood.at n=24A273121
- Expansion of e.g.f. 2/(1 + sqrt(1 - 4*x*exp(x))).at n=5A295238
- Array read by antidiagonals: T(m,n) is the number of partitions of the vertices of the grid graph P_m X P_n into dominating sets.at n=30A391824
- Array read by antidiagonals: T(m,n) is the number of partitions of the vertices of the grid graph P_m X P_n into dominating sets.at n=33A391824
- Number of partitions of the vertices of the n X 3 grid graph into dominating sets.at n=5A391827