10915
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 13680
- Proper Divisor Sum (Aliquot Sum)
- 2765
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8352
- Möbius Function
- -1
- Radical
- 10915
- 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
- 68
- 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
- 11*n^2 + 11*n + 3.at n=31A006222
- Expansion of 1/((1-x)*(1-2*x)*(1-x^2)).at n=12A011377
- Numbers k at which the fractional part of tan(k) reaches a record high.at n=15A019435
- Number of binary rooted trees with n nodes and height at most 7.at n=17A036590
- A065834 converted to base 10.at n=8A065835
- Numbers k such that sigma(k-3) + sigma(k+3) = sigma(2*k).at n=15A067129
- a(n) = Sum_{d|n} phi(d^3).at n=27A068963
- Generalized Jacobsthal numbers.at n=14A083579
- Expansion of 1/sqrt((1-x)^2-12x^4).at n=13A098484
- Numbers k such that (273*2^k+1)^2-2 is prime.at n=23A100914
- Maximal number of squares of side 1 in an ellipse of semiaxes n,2n.at n=41A108126
- a(n) = n*(8*n-1).at n=37A139274
- Triangle T(n,k) read by rows: T(n,k) = 1 if k=1 or k=n, otherwise T(n,k) = (3*n-3*k+1)*T(n-1,k-1) + (3*k-2)*T(n-1,k).at n=29A142458
- Triangle T(n,k) read by rows: T(n,k) = 1 if k=1 or k=n, otherwise T(n,k) = (3*n-3*k+1)*T(n-1,k-1) + (3*k-2)*T(n-1,k).at n=34A142458
- a(n) = 2*(4^n - 1)/3 - n.at n=6A144414
- a(n) = (n^3 - n + 9)/3.at n=31A155753
- Triangle: m=5; e(n,k,n)=(k + m - 1)*e(n - 1, k, m) + (m*n - k + 1 - m)*e(n - 1, k - 1, m); t(n,k)=e(n,k,m)+e(n,n-k,m).at n=16A156188
- Triangle: m=5; e(n,k,n)=(k + m - 1)*e(n - 1, k, m) + (m*n - k + 1 - m)*e(n - 1, k - 1, m); t(n,k)=e(n,k,m)+e(n,n-k,m).at n=19A156188
- Numbers k with property that the sum of 70 successive primes starting with prime(k) is a square.at n=4A166255
- Triangle T(n,m) = 2*A022168(n,m) - binomial(n, m), 0 <= m <= n, read by rows.at n=29A174528