10549
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
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 13248
- Proper Divisor Sum (Aliquot Sum)
- 2699
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8160
- Möbius Function
- -1
- Radical
- 10549
- 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
- 55
- 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
- Squarefree n such that the elliptic curve n*y^2 = x^3 - x arising in the "congruent number" problem has rank 3.at n=16A062693
- Expansion of g.f. 1/(1 - 3*x + 2*x^3).at n=9A077846
- a(n) is the smallest number x such that gcd(prime(x)+1,x+1) = n.at n=49A084316
- Numerators of asymptotic expansion of first root of Ziegler's cubic in an imaginary quadratic field.at n=11A115344
- Irregular triangle read by rows: first row is 1, and n-th row gives the coefficients of x^(n - 1)*R(n,x + 1/x)/(x + 1/x), where R(n,x) is the n-th row polynomial for A060187.at n=38A143506
- Irregular triangle read by rows: first row is 1, and n-th row gives the coefficients of x^(n - 1)*R(n,x + 1/x)/(x + 1/x), where R(n,x) is the n-th row polynomial for A060187.at n=46A143506
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (0, -1, 1), (0, 1, 1), (1, 0, -1)}.at n=9A148791
- a(n) = 144*n^2 - 127*n + 28.at n=8A156719
- G.f.: A(x,y) = exp( Sum_{n>=1} [Sum_{k=0..n} C(n,k)^3*y^k] * x^n/n ) = Sum_{n>=0,k=0..n} T(n,k)*x^n*y^k, as a triangle of coefficients T(n,k) read by rows.at n=31A181143
- G.f.: A(x,y) = exp( Sum_{n>=1} [Sum_{k=0..n} C(n,k)^3*y^k] * x^n/n ) = Sum_{n>=0,k=0..n} T(n,k)*x^n*y^k, as a triangle of coefficients T(n,k) read by rows.at n=32A181143
- Upper Beatty array of the golden ratio, (1+sqrt(5))/2.at n=48A181661
- Number of subsets of {1,2,...,n} with the sum of reciprocals <= 1.at n=16A212657
- Number of partitions of n in which any two parts differ by at most 7.at n=40A218509
- Number of (n+2) X (1+2) 0..1 arrays with each 3 X 3 subblock having clockwise perimeter pattern 00000001 00000011 or 00010001.at n=8A260537
- T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00010001.at n=36A260544
- T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00010001.at n=44A260544
- a(n) = r*a(ceiling(n/2))+s*a(floor(n/2)) with a(1)=1 and (r,s)=(4,1).at n=36A268527
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 473", based on the 5-celled von Neumann neighborhood.at n=24A272425
- Sum of the smallest parts in the partitions of n into 7 parts.at n=47A308927
- Indices of primes followed by a gap (distance to next larger prime) of 38.at n=24A320717