10751
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 11592
- Proper Divisor Sum (Aliquot Sum)
- 841
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9912
- Möbius Function
- 1
- Radical
- 10751
- 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
- 192
- 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
- Number of distinct nonzero absolute values of Sum_{j=1..n} sigma_j * exp(i * Pi * j / n) where sigma_j = +- 1.at n=19A013914
- Numbers k such that 5*3^k + 2 is prime.at n=31A058590
- Triangle P, read by rows, such that P^3 transforms column k of P into column k+1 of P, so that column k of P equals column 0 of P^(3*k+1), where P^3 denotes the matrix cube of P.at n=32A113370
- Triangle, read by rows, given by the product R^2*Q^-1 = Q^3*P^-2 using triangular matrices P=A113370, Q=A113381, R=A113389.at n=24A114150
- Integers of the form (p(n+1)*p(n) - 1)/(p(n+1) - p(n)) where p(n) denotes the n-th prime.at n=46A128490
- 2*A007318^(2) - A000012.at n=48A132307
- A sequence of asymptotic density zeta(10) - 1, where zeta is the Riemann zeta function.at n=10A143036
- Total number of Fibonacci parts in all partitions of n.at n=23A144115
- Number of n X n binary arrays symmetric about both diagonal and antidiagonal with all ones connected only in a 1100-0110-0011 pattern in any orientation.at n=15A146449
- Number of proper divisors of n!.at n=17A153823
- a(n) = 512n - 1.at n=20A158011
- a(n) = 42*n^2 - 1.at n=15A158626
- a(n) = 21*2^n - 1.at n=9A171389
- Partial sums of Proth primes A080076.at n=20A172243
- Triangle of coefficients of polynomials v(n,x) jointly generated with A210747; see the Formula section.at n=47A210748
- Integers n such that both 2*n^2 + 3*(n+2)^2 and 3*n^2 + 2*(n+2)^2 are prime.at n=38A216849
- Numbers x such that x = concatenate(a, b) and phi(a) + phi(b) = sigma(x) - x.at n=8A254624
- Decimal representation of the middle column of the "Rule 169" elementary cellular automaton starting with a single ON (black) cell.at n=13A267589
- Number of integers in n-th generation of tree T(-1/2) defined in Comments.at n=24A274147
- 35-gonal numbers: a(n) = n*(33*n-31)/2.at n=26A282851