10835
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
- 8
- Divisor Sum
- 14256
- Proper Divisor Sum (Aliquot Sum)
- 3421
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7840
- Möbius Function
- -1
- Radical
- 10835
- 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
- a(n) is the solution to the postage stamp problem with 5 denominations and n stamps.at n=18A001210
- Convolution of Fibonacci numbers and {F(2), F(3), F(4), ...}.at n=14A023610
- Expansion of 1/((1-x)(1-8x)(1-10x)(1-12x)).at n=3A025007
- a(n) = n*Pell(n-2).at n=11A093969
- Indices of primes in sequence defined by A(0) = 61, A(n) = 10*A(n-1) + 11 for n > 0.at n=11A101522
- a(n) = 6*n*(n-1) - 1.at n=43A103115
- Triangle read by rows :T(n,k)=Sum_{j, j>=0}A089942(n,j)*binomial(j,k).at n=47A127501
- Triangle T(n, k, q) = binomial(n, k) + q^n*binomial(n-2, k-1) - 1 with T(n, 0) = T(n, n) = 1 and q = 2, read by rows.at n=48A173046
- Triangle T(n, k, q) = binomial(n, k) + q^n*binomial(n-2, k-1) - 1 with T(n, 0) = T(n, n) = 1 and q = 2, read by rows.at n=51A173046
- Numbers that have 9 terms in their Zeckendorf representation.at n=35A179249
- Number of binary arrays indicating the locations of trailing edge maxima of a random length-n 0..3 array extended with zeros and convolved with 1,-2,1.at n=16A222148
- Bases b where exactly seven primes p with p < b exist such that p is a base-b Wieferich prime.at n=24A325883
- Composite numbers k coprime to 8 such that k divides Pell(k - Kronecker(8,k)), Pell = A000129.at n=27A327651
- Number of partitions of n into an odd number of relatively prime parts.at n=36A339398
- a(n) = Sum_{k=2..n} binomial(k,2) * floor(n/k).at n=37A366967
- Integers k such that 2^k contains all powers of 2 not exceeding k as substrings.at n=29A372680
- a(n) is the side y of smallest possible length in triangles with integer sides corresponding to x=A375748(n).at n=46A375749
- Number of subwords of the form UUUU in nondecreasing Dyck paths of length 2n.at n=11A375995
- G.f.: Sum_{k>=0} x^k * Product_{j=1..5*k} (1 + x^j)/(1 - x^j).at n=19A385091