10165
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
- 8
- Divisor Sum
- 12960
- Proper Divisor Sum (Aliquot Sum)
- 2795
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7632
- Möbius Function
- -1
- Radical
- 10165
- 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
- 34
- 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 discordant permutations.at n=6A000562
- Numbers k such that the continued fraction for sqrt(k) has period 92.at n=23A020431
- Denominators of continued fraction convergents to sqrt(780).at n=6A042505
- a(n) = (-1)^(n+1)*Sum_{k=0..n+1}(-1)^k*binomial(2*k,k).at n=7A054108
- Triangle T(n,k) defined by Sum_{n >= 0,m >= 0} T(n,m)*x^m*y^n = 1 + y*(1 + 3*x - 4*x^2*y - 3*x^2*y^2 - 3*x^3*y^2 + 4*x^4*y^3)/((1 - y - 2*x*y - x*y^2 + x^3*y^3)*(1 - x*y)).at n=59A061702
- a(n) is the smallest k such that (k^3 + 1)/(n^3 + 1) is an integer > 1.at n=21A065964
- Smallest number k such that there are exactly n relatively prime numbers using all digits of k.at n=35A075604
- a(n) is the smallest number m >= 2 for which the set of prime factors of m, m-1 and m+1 contains at least the first n primes.at n=8A080611
- a(n) = n^3 - n^2 + 1.at n=22A100104
- Triangle read by rows: T(n,k) is the number of k-matchings in the C_n X P_2 graph (C_n is the cycle graph on n vertices and P_2 is the path graph on 2 vertices).at n=56A102079
- Expansion of x/((1-x)*sqrt(1+4*x^2)).at n=17A104551
- Expansion of x/((1-x)*sqrt(1+4*x^2)).at n=18A104551
- Triangle T(n,k) read by rows: number of k X k triangular matrices with nonnegative integer entries and without zero rows or columns such that sum of all entries is equal to n, n>=1, 1<=k<=n.at n=48A137251
- Table of coefficients in the expansion of the rational function 1/{(1-x)^2 - y*(1+x)^2}.at n=49A142977
- a(n) = 242*n + 1.at n=41A157958
- a(n) = 484*n + 1.at n=20A158326
- Number of nX3 1..3 arrays containing at least one of each value, all equal values connected, rows considered as a single number in nondecreasing order, and columns considered as a single number in nondecreasing order.at n=7A166801
- a(n) = 5*n^2 + 11*n + 1.at n=44A172044
- Concentric 22-gonal numbers.at n=43A195149
- Centered 44-gonal numbers.at n=21A195318