10515
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 16848
- Proper Divisor Sum (Aliquot Sum)
- 6333
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5600
- Möbius Function
- -1
- Radical
- 10515
- 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
- 179
- 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
- no
- Odd
- yes
Appears in sequences
- Number of planted identity trees where non-root, non-leaf nodes an even distance from root are of degree 2.at n=20A007560
- Pseudoprimes to base 19.at n=43A020147
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 33.at n=39A031531
- Number of partitions of n into parts not of the form 21k, 21k+5 or 21k-5. Also number of partitions with at most 4 parts of size 1 and differences between parts at distance 9 are greater than 1.at n=35A035983
- Unsigned row sums of triangle A104030, which is the matrix inverse of the triangle of pairwise sums of trinomial coefficients.at n=5A104032
- Partial sums of A003325.at n=34A139211
- Number of nXnXn triangular nonnegative integer arrays, symmetric under 120 degree rotation, with all sums of an element and its neighbors <= 2.at n=11A166197
- Number of 11X11X11 triangular nonnegative integer arrays, symmetric under 120 degree rotation, with all sums of an element and its neighbors <= n.at n=2A166219
- Numbers k such that Sum_(i=1..k) prime(i)*(-1)^(i+1) is a square.at n=18A175117
- Total number of positive integers below 10^n requiring 8 positive biquadrates in their representation as sum of biquadrates.at n=4A186661
- Number of 4-step S, E, and NW-moving king's tours on an n X n board summed over all starting positions.at n=23A187509
- a(n) = 1 + 2*n + 2^2*n*[n/2] + 2^3*n*[n/2]*[n/3] + 2^4*n*[n/2]*[n/3]*[n/4] + ... where [x]=floor(x).at n=7A208060
- a(n) = n*(7*n^2-12*n+7)/2.at n=15A226451
- Number of partitions of n such that (greatest part) - (least part) > number of parts.at n=37A237833
- Expansion of exp( Sum_{n >= 1} A000364(n)*x^n/n ).at n=5A255881
- Expansion of exp( Sum_{n >= 1} R(n,u)*x^n/n ), where R(n,u) denotes the n-th row polynomial of A086646.at n=15A255905
- Square array read by antidiagonals upwards: the n-th row o.g.f. is exp( Sum_{i >= 1} c(n,i)*x^i/i ) for n >= 1, where c(n,k) is Shanks' array of generalized Euler and class numbers.at n=20A262143
- a(n) = A277715(n) / 3.at n=49A277716
- a(n) = hypergeom([-n, n - 1/2], [1], -4).at n=4A299506
- Rectangular array A(n, k) = hypergeom([-k, k + n/2 - 1], [1], -4) with row n >= 0 and k >= 0, read by ascending antidiagonals.at n=19A300945