10219
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 11160
- Proper Divisor Sum (Aliquot Sum)
- 941
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9280
- Möbius Function
- 1
- Radical
- 10219
- 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
- 86
- 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(n) = dot_product(1,2,...,n)*(6,7,...,n,1,2,3,4,5).at n=27A026046
- Numbers k such that 179*2^k+1 is prime.at n=24A032466
- a(n) = ceiling((n + 7/10)^3).at n=20A034133
- Number of partitions of n with equal number of parts congruent to each of 1, 3 and 4 (mod 5).at n=58A035580
- First differences of A037260.at n=32A037261
- Non-palindromic numbers such that the two largest proper divisors are palindromes having at least two digits and no other divisor is a palindrome with at least two digits.at n=17A074889
- Number of primes corresponding to n-th primeval number A072857(n).at n=53A076497
- Number of partitions of n such that the set of even parts has only one element.at n=42A090867
- Least j > 1 such that j^2 = (4*n^2 + 2)*(k^2) + (4*n^2 + 2)*k + 1.at n=13A106231
- Numerator of Bernoulli(n, 1/7).at n=6A158334
- a(n) = 15n^2 + 3n + 1.at n=25A165806
- Second differences of A000219.at n=18A191660
- Numbers with exactly 12 nonprime substrings (substrings with leading zeros are considered to be nonprime).at n=31A213319
- Number of n X 3 0..1 arrays with rows, diagonals and antidiagonals unimodal and columns nondecreasing.at n=23A223833
- Numbers n for which number of iterations to reach the largest equals number of iterations to reach 1 from the largest in Collatz (3x+1) trajectory of n.at n=22A224303
- Odd numbers n for which the number of iterations to reach the largest equals number of iterations to reach 1 from the largest in Collatz (3x+1) trajectory of n.at n=9A224533
- Number of length 4+3 0..n arrays with some disjoint pairs in every consecutive four terms having the same sum.at n=7A247536
- G.f. A(x) satisfies: A(x)^2 - 2*A(x)^3 = A(x^2).at n=8A273095
- Number of partitions of n into parts having the same number of distinct prime divisors as n.at n=53A300979
- Expansion of Product_{j>=1} 1/(1 - x^j*Product_{k>=1} 1/(1 - x^k)^(k*j))^j.at n=8A307570