10573
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 10780
- Proper Divisor Sum (Aliquot Sum)
- 207
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10368
- Möbius Function
- 1
- Radical
- 10573
- 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
- 104
- 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
- a(0) = 1, a(n) = 11*n^2 + 2 for n>0.at n=31A010003
- a(n) = T(n,n-2), T given by A026568. Also a(n) = number of integer strings s(0), ..., s(n) counted by T, such that s(n) = 2.at n=10A026571
- a(n) = Sum_{k=0..2n-2} T(n,k) * T(n,k+2), with T given by A026568.at n=4A027279
- Numerators of continued fraction convergents to sqrt(517).at n=7A041988
- a(n) = floor(Pi^n mod n^Pi).at n=26A066434
- Numerator of 2*BernoulliB[2*(n+1)]*(4^(n+1)-1)/(2*(n+1))] divided by numerator of the series coefficients of 1/(1 + Cosh[x]).at n=71A089170
- Where records occur in A179329.at n=14A179997
- a(n)=a(n-1)+floor((a(n-2)+a(n-3))/2), with a(n)=n for n<3.at n=23A214040
- Semiprimes which have one or more occurrences of exactly five different digits.at n=35A235693
- Nonprimes such that it takes exactly 3 iterations of reverse-and-add digits to generate a prime.at n=13A245208
- Number of length 3+2 0..n arrays with some pair in every consecutive three terms totalling exactly n.at n=11A245872
- Five-digit odd semiprimes with all digits distinct.at n=26A247948
- Quasi-Carmichael numbers to exactly three bases.at n=7A257753
- Semiprimes whose prime factors are of equal binary length and which differ from each other in exactly two bit positions.at n=34A261074
- a(n) is the number of consecutive even prime gap pairs (g1, g2) satisfying g1 == 0 (mod 6) and g2 == 0 (mod 6) out of the first 2^n consecutive even prime gap pairs.at n=16A345332
- Composite numbers k such that A378056(k) = gcd(lcm{d+1 : d|k}, lcm{d-1 : d > 1 and d|k}) = 2.at n=35A378057