10578
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 22176
- Proper Divisor Sum (Aliquot Sum)
- 11598
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3360
- Möbius Function
- 1
- Radical
- 10578
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 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
- yes
- Odd
- no
Appears in sequences
- a(n) = floor(n*(n-1)*(n-2)/7).at n=43A011889
- Numerators of continued fraction convergents to sqrt(53).at n=7A041090
- Numbers whose base-2 representation has exactly 12 runs.at n=27A043579
- a(n) = 6*n^2 + 12*n.at n=40A067726
- Indices of primes in sequence defined by A(0) = 47, A(n) = 10*A(n-1) - 53 for n > 0.at n=9A101717
- One third of the sum of the first n primes, when an integer.at n=35A112270
- Numbers k such that the concatenation of k with k-2 gives a square.at n=3A115431
- Duplicate of A115431.at n=3A116117
- Duplicate of A115431.at n=3A116135
- a(n) = (n-1)*(n+4)*(n+6)/6 for n > 1, a(1)=1.at n=36A137742
- Numbers k such that there are 9 digits in k^2 and for each factor f of 9 (1,3) the sum of digit groupings of size f is a square.at n=23A153747
- The sums of pairs of adjacent terms are the odd palindromic primes in ascending order.at n=26A181882
- Triangle of coefficients of polynomials v(n,x) jointly generated with A209162; see the Formula section.at n=48A209163
- Minimum even value unattainable as the sum of 6 attained values of i*(i-1) with i in 0..n.at n=44A225292
- Number of partitions of n having (sum of odd parts) >= (sum of even parts).at n=36A239263
- Number of partitions of n containing the number of distinct parts as a part.at n=38A239945
- Number of different positions in which a square with side length k, 1 <= k <= n - floor(n/3), can be placed within a bi-symmetric triangle of 1 X 1 squares of height n.at n=34A241526
- Let e_n(k)>=0 denote the exponent of prime(k) in the prime power representation of n. The sequence lists 1 followed by numbers n for which e_n(2*i-1)=e_n(2*i), for all i>=1.at n=29A275407
- a(n) = (n-4)*(n+1)*(n+3)/6.at n=36A275874
- Number of n X 3 0..1 arrays with every element equal to 0, 2, 3, 5 or 6 king-move adjacent elements, with upper left element zero.at n=10A298377