10190
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 18360
- Proper Divisor Sum (Aliquot Sum)
- 8170
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4072
- Möbius Function
- -1
- Radical
- 10190
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- 73
- 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
- G.f.: 1/Product_{k>=1} (1-prime(k)*x^prime(k)).at n=19A002098
- Expansion of Product_{m>=1} (1+x^m)^2.at n=28A022567
- Expansion of 1/((1-3x)(1-7x)(1-10x)(1-11x)).at n=3A028096
- Expansion of (1/(1-x^2))*Product_{m>=0} 1/(1-x^(2m+1)).at n=46A038348
- a(n) = Sum_{i=1..n} LookAndSay(i).at n=18A079664
- a(n)=Sum( Product p_i, {Sum p_i=prime(n)}, p_i is prime ).at n=7A103275
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, -1), (1, 0, 0), (1, 1, 1)}.at n=8A150066
- Number of 0..n arrays x(0..8) of 9 elements with zero 4th differences.at n=44A200445
- Numbers with exactly 12 nonprime substrings (substrings with leading zeros are considered to be nonprime).at n=25A213319
- Number of distinct values of the sum of i^2 over 8 realizations of i in 0..n.at n=36A225275
- Nonprimes such that it takes exactly 4 iterations of reverse-and-add digits to generate a prime.at n=2A245209
- Indices of squares of primes in A098550.at n=27A251240
- Number of partitions of n with product of multiplicities of parts equal to 8.at n=50A266691
- G.f.: 1/((1-t^9)^2*(1-t)*(1-t^3)*(1-t^5)*(1-t^7)*(1-t^11)*(1-t^13)*(1-t^15)*(1-t^17)).at n=60A266749
- Lexicographically first sequence starting with a(1) = 1, with no duplicate term, such that a(n) is the result of a self-additive linear combination of its own digits (concatenated sometimes into substrings).at n=40A323823
- Counterexamples to a conjecture of Ramanujan about congruences related to the partition function.at n=17A340757
- Numbers k such that k + sum of digits of k is a proper prime power.at n=47A342773
- Triangle read by rows: T(n,k) = arithmetic derivative of (1 + A002110(n) + A002110(k)), 1 <= k <= n, where A002110(n) is the n-th primorial number.at n=32A373845
- Expansion of sqrt((1-2*x) / (1-6*x)^5).at n=4A387233