10411
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 7
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 10800
- Proper Divisor Sum (Aliquot Sum)
- 389
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10024
- Möbius Function
- 1
- Radical
- 10411
- 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
- 148
- 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
- Semiprimes p1*p2 such that p2 > p1 and p2 mod p1 = 11.at n=34A064909
- Numbers k such that sigma(k) divides sigma(phi(k)).at n=36A066831
- Numbers n such that sigma(phi(n))/sigma(n) = 2.at n=25A067382
- a(n) = sum of the first n upper twin primes.at n=32A086168
- 4-Smith numbers.at n=6A103125
- Numbers k such that for any single digit d of k the d-th semiprime sp(k) is substring of k.at n=30A135441
- Number of planar n X n X n binary triangular grids symmetric both under 120 degree rotation and reflection with no more than 11 ones in any 5 X 5 X 5 subtriangle.at n=11A153996
- Positive numbers y such that y^2 is of the form x^2+(x+359)^2 with integer x.at n=7A159844
- Values of n such that L(12) and N(12) are both prime, where L(k) = (n^2+n+1)*2^(2*k) + (2*n+1)*2^k + 1, N(k) = (n^2+n+1)*2^k + n.at n=26A227515
- Number of (n+2)X(2+2) nonnegative integer arrays with all values the knight distance from the upper left minus as much as 1, with successive minimum path knight move differences either 0 or +1, and any unreachable value zero.at n=4A253418
- Number of (n+2)X(5+2) nonnegative integer arrays with all values the knight distance from the upper left minus as much as 1, with successive minimum path knight move differences either 0 or +1, and any unreachable value zero.at n=1A253421
- T(n,k)=Number of (n+2)X(k+2) nonnegative integer arrays with all values the knight distance from the upper left minus as much as 1, with successive minimum path knight move differences either 0 or +1, and any unreachable value zero.at n=16A253424
- T(n,k)=Number of (n+2)X(k+2) nonnegative integer arrays with all values the knight distance from the upper left minus as much as 1, with successive minimum path knight move differences either 0 or +1, and any unreachable value zero.at n=19A253424
- Square array read by antidiagonals upwards: the n-th row o.g.f. is exp( Sum_{i >= 1} d(n,i+1)*x^i/i ) for n >= 1, where d(n,k) is Shanks's array of generalized Euler and class numbers.at n=13A262144
- Binomial(n,4) - A290447(n).at n=34A290461
- a(n) = A006561(n) - A290447(n).at n=34A290465
- Limit of the number of (unlabeled) rooted trees without unary nodes where n is the difference between the number of leafs and the maximal outdegree as the tree size increases.at n=8A292087
- Number of (unlabeled) rooted trees with n leaf nodes and without unary nodes such that the maximum of the node outdegrees equals ten.at n=8A292236
- Numbers k such that f(k), f(k+1) and f(k+2) are all primes, where f(k) = (2k+1)^2 - 2 (A073577).at n=36A293620
- Partial sums of A348227.at n=48A348228