10579
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- 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)
- 221
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10360
- Möbius Function
- 1
- Radical
- 10579
- 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
- 55
- Smith Number
- yes
- 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 80.at n=35A020419
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 23 ones.at n=3A031791
- Odd composite numbers which in base 2 contain their largest proper factor as a substring of digits.at n=22A063131
- Composite numbers not divisible by 2, 3, 5 or 7 which in base 2 contain their largest proper factor as a substring.at n=18A063138
- Composite numbers not divisible by 2 which in base 4 contain their largest proper factor as a substring.at n=6A063145
- Smallest composite number in base n which contains its largest proper factor as a substring.at n=14A063248
- Greedy frac multiples of Catalan's constant, G: a(1)=1, Sum_{n>0} frac(a(n)*x) = 1 at x=G=A006752, where "frac(y)" denotes the fractional part of y.at n=3A080158
- Number of increasing subsequences that can be made from the sequence of successive numbers.at n=23A091955
- a(1)=0; for i>=1, a(i+1)=position of first occurrence of a(i) in decimal expansion of 1/e.at n=14A098320
- Numbers n such that 4*10^n + R_n + 6 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=9A102982
- Numbers k such that k and 8*k, taken together, are pandigital.at n=3A114126
- a(n) = 5*n^2 - 1.at n=45A134538
- G.f. satisfies A(x) = Product_{k>0} (1+x^k*A(x)).at n=11A145267
- Denominators of the convergents of the continued fraction for Catalan's constant L(2, chi4), where L(s, chi4) is the Dirichlet L-function for the non-principal character modulo 4.at n=8A153070
- a(n) = 529*n - 1.at n=19A158365
- a(n) = 20*n^2 - 1.at n=22A158491
- a(n) = 5*n^2 + 31*n + 1.at n=43A172193
- a(n) = a(n-1)+a(n-2)+a(n-3)+4*n-8 with a(0)=0, a(1)=0 and a(2)=1.at n=14A180668
- The sums of pairs of adjacent terms are the odd palindromic primes in ascending order.at n=26A181884
- The maximal set of disjoint prime cycle permutations on n elements which generate unique subgroups of S(n).at n=8A186202