10475
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 13020
- Proper Divisor Sum (Aliquot Sum)
- 2545
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8360
- Möbius Function
- 0
- Radical
- 2095
- Omega Function (Ω)
- 3
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 86
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- Number of partitions satisfying cn(1,5) < cn(2,5) + cn(3,5) and cn(4,5) < cn(2,5) + cn(3,5).at n=37A039888
- Row 3 of array in A047666.at n=24A047667
- a(n) = 1 + Sum_{i=1..n} phi(i)^2.at n=41A049454
- G.f. A(x) satisfies A(x)^5 = BINOMIAL(A(x)^4); that is, the binomial transform of the coefficients in A(x)^4 yields the coefficients in A(x)^5.at n=5A090356
- Numbers k such that k + prime(k) gives a triangular number.at n=38A115882
- Values of y such that x^2 + y^2 = 41^n with x and y coprime and 0 < x < y.at n=4A230744
- Number of non-equivalent (mod D_4) ways to arrange 3 points on an n X n square grid so that they are not collinear.at n=7A235454
- a(n) = Sum_{k=1..n-1} k^5*sigma(k)*sigma(n-k).at n=4A259693
- 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 902", based on the 5-celled von Neumann neighborhood.at n=13A284358
- Number of dissections of an n-gon by nonintersecting diagonals into polygons with a prime number of sides counted up to rotations and reflections.at n=10A295419
- Integers k such that 2^k contains all powers of 2 not exceeding k as substrings.at n=27A372680
- a(n) = 13*n^2 + 10*n + 3.at n=28A387659
- Indices where the cumulative sum of cos(2k+1)^(2k+1) reaches a record low value.at n=12A389560