10185
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 18816
- Proper Divisor Sum (Aliquot Sum)
- 8631
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4608
- Möbius Function
- 1
- Radical
- 10185
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- yes
- Harshad Number
- yes
- 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
- Coefficient of x^4 in expansion of (1+x+x^2)^n.at n=19A005712
- Pseudoprimes to base 22.at n=44A020150
- a(n) = Sum_{i=1..floor((n+2)/4)} a(2i-1)*a(n-2i+1), with a(1)=2, a(2)=1, and a(3)=3.at n=11A024961
- Numbers k > 1 such that, in base 4, k and k^2 contain the same digits in the same proportion.at n=39A061658
- a(n) = n^3 - n^2 + n - 1 = (n-1) * (n^2 + 1).at n=22A062158
- a(1) = 5; a(n) is the smallest multiple of a(n-1) that contains all the digits of a(n-1) and is not a multiple of 10.at n=3A077702
- a(1) =5, a(n) = smallest multiple of a(n-1) (not equal to 10^k*a(n-1)) obtained by inserting digits anywhere in a(n-1).at n=3A080490
- a(1) = 5, a(n) = smallest odd multiple of a(n-1) that contains all the decimal digits of a(n-1).at n=3A088418
- The following triangle is based on Pascal's triangle. The r-th term of the n-th row is sum of C(n,r) successive integers so that the sum of all the terms of the row is (2^n)*(2^n+1)/2, the 2^n -th triangular number. Sequence contains the triangle read by rows.at n=64A112358
- Starting numbers for which the RATS sequence has eventual period 14.at n=37A114615
- a(n) = 104*n + 9977.at n=2A126978
- a(n) = Sum_{m=1..n} lcm(s(n,m),S(n,m)), where s(n,m) is an unsigned Stirling number of the first kind and S(n,m) is a Stirling number of the second kind. (a(n) = sum of terms in n-th row of triangle A128264.)at n=5A128265
- 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), (1, -1), (1, 1)}.at n=7A151301
- a(n) = (2*n^3 + 5*n^2 - 17*n)/2.at n=20A162259
- a(n) = n*(17*n - 13)/2.at n=35A180232
- Numbers n such that (n^6 + 1091)/4 is prime.at n=7A181112
- Expansion of A(x) = (1 + 2*x^2 + 6*x^3 + 9*x^4 + 8*x^5 + 5*x^6) / (1 - x - 2*x^2 - 3*x^3 - 3*x^4 - 2*x^5 - x^6).at n=9A187004
- Number of binary strings of length n with no substrings equal to 00000 or 00100.at n=14A188765
- Triangle of coefficients of polynomials v(n,x) jointly generated with A210557; see the Formula section.at n=52A210558
- Number of primes p such that sqrt(q) - sqrt(p) > 1/n, where q is the prime after p.at n=41A218015