10765
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12924
- Proper Divisor Sum (Aliquot Sum)
- 2159
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8608
- Möbius Function
- 1
- Radical
- 10765
- 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
- 117
- 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
- Number of homeomorphically irreducible (or series-reduced) trees with n pendant nodes, or continua with n non-cut points, or leaves.at n=14A007827
- Numbers k such that the continued fraction for sqrt(k) has period 75.at n=6A020414
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted then there are a pair of central terms both equal to 10.at n=13A031423
- An approximation to sigma_{5/2}(n): round( sum_{d|n} d^(5/2) ).at n=40A058273
- An approximation to sigma_{5/2}(n): ceiling( sum_{d|n} d^(5/2) ).at n=40A058274
- Indices n of primes p(n), p(n+2) such that p(n)+1 and p(n+2)+1 have the same largest prime factor.at n=14A105404
- Semiprimes in A054556.at n=15A113693
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, -1, 1), (-1, 0, -1), (1, 0, 1), (1, 1, -1)}.at n=9A148700
- Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0) and consisting of n steps taken from {(-1, 1), (-1, 0), (0, -1), (0, 1), (1, -1)}.at n=9A151268
- Number of (w,x,y) with all terms in {0,...,n} and max(w,x,y) >= 2*min(w,x,y).at n=23A213390
- Numbers n such that 36n+11, 36(n+1)+11, 36(n+2)+11 and 36(n+3)+11 are prime.at n=15A255608
- Triangle read by rows: T(n,k) (n>=1, k>=0) is the number of posets with n elements and rank k (or depth k+1).at n=46A263859
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 249", based on the 5-celled von Neumann neighborhood.at n=23A271014
- a(n) is the smallest b > 1 such that b^n - (b-1)^n has all divisors d == 1 (mod n).at n=51A321576
- Number of integer partitions of n of even length whose greatest multiplicity is at most half their length.at n=39A338914
- Sum of two consecutive products of Fibonacci and Pell numbers: F(n)*P(n) + F(n+1)*P(n+1).at n=7A344684
- Triangle read by rows: T(n,k) is the number of unlabeled weakly graded (ranked) posets with n elements and rank k.at n=57A361953
- Stellated octagon numbers: a(n) = 20*n^2 + 8*n + 1.at n=23A381196
- Square array A(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where column k is the expansion of e.g.f. B(x)^k, where B(x) is the e.g.f. of A385059.at n=49A385062