10471
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
- 10792
- Proper Divisor Sum (Aliquot Sum)
- 321
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10152
- Möbius Function
- 1
- Radical
- 10471
- 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(0) = 1, a(n) = 29*n^2 + 2 for n>0.at n=19A010019
- Denominators of continued fraction convergents to sqrt(936).at n=9A042811
- Let Py(n)=A000330(n)=n-th square pyramidal number. Consider all integer triples (i,j,k), j >= k>0, with Py(i)=Py(j)+Py(k), ordered by increasing i; sequence gives j values.at n=42A053720
- Number of pentagonal regions in regular n-gon with all diagonals drawn.at n=32A067152
- a(n) is the least x such that A094892(x)=n.at n=3A095391
- Row sums of triangle A134464.at n=36A134465
- Numerator of Bernoulli(n, -1/7).at n=6A158489
- Last occurrence of n partitions in A204814.at n=13A205301
- a(n) = 2*A090495(n) - 1.at n=18A274297
- Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 389", based on the 5-celled von Neumann neighborhood.at n=26A281676
- Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 454", based on the 5-celled von Neumann neighborhood.at n=13A282308
- Numbers k such that (32*10^k + 337)/9 is prime.at n=20A290282
- Triangle read by rows: T(n,k), n >= 1, k = 0..A005867(n), is the smallest integer m > 0 such that the interval [P(n)*m+1, P(n)*(m+1)] includes exactly k primes, where P(n) = A002110(n) is the n-th primorial, or 0 if no such m exists.at n=17A319039
- a(n) = Sum_{d|n} mu(n/d) * binomial(7*d,d) / (6*d+1).at n=4A346938
- Partial sums of A224613.at n=36A365446