10135
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12168
- Proper Divisor Sum (Aliquot Sum)
- 2033
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8104
- Möbius Function
- 1
- Radical
- 10135
- 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
- 34
- 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
- Sums of five consecutive squares: a(n) = n^2 + (n+1)^2 + (n+2)^2 + (n+3)^2 + (n+4)^2.at n=43A027578
- Number of partitions in parts not of the form 11k, 11k+3 or 11k-3. Also number of partitions with at most 2 parts of size 1 and differences between parts at distance 4 are greater than 1.at n=40A035946
- Numbers whose base-10 representation has exactly 5 runs.at n=22A043641
- a(n) is the least number with exactly n permutations of digits that are primes.at n=14A046893
- Number of (unordered) ways of making change for n cents using coins of 1/2, 1, 2, 3, 5, 10, 20, 25, 50, 100 cents (all historical U.S.A. coinage denominations up to 100 cents).at n=40A067997
- Riordan array (1/sqrt(1-4*x), (1/sqrt(1-4*x)-1)/2).at n=50A116395
- Where records occur in A117831.at n=15A118474
- Number of binary words of length n containing at least one subword 10^{6}1 and no subwords 10^{i}1 with i<6.at n=41A143286
- Numbers k such that the sum of the decimal digits of k is a substring of k, of k^2 and of k^3.at n=43A162017
- Smallest number m such that exactly n odd numbers can be seen as proper subsequences of m in decimal representation.at n=17A164766
- Integers of the form 4n+3 for which Sum_{i=1..u} J(i,4n+3) obtains value zero exactly 9 times, when u ranges from 1 to (4n+3). Here J(i,k) is the Jacobi symbol.at n=30A166059
- Number of strings of n+2 numbers x(i) in -5..5 with the sum of x(i) equal to zero and the sums of x(i)*x(i+1) and x(i)*x(i+2) equal to each other.at n=4A184057
- T(n,k) = Number of strings of n+2 numbers x(i) in -k..k with the sum of x(i) equal to zero and the sums of x(i)*x(i+1) and x(i)*x(i+2) equal to each other.at n=40A184061
- Numbers which may represent a date in "condensed European notation" DDMMYY.at n=35A213182
- Numbers which may represent a date in "condensed American notation" MMDDYY.at n=35A213184
- Semiprimes p such that next semiprime after p is p + 10.at n=39A217030
- Number of partitions of n where the difference between consecutive parts is at most 8.at n=34A238868
- Sequence defined by a(1)=a(2)=1 and a(n) = gray(a(n-1)) + gray(a(n-2)), with gray(m) = A003188(m).at n=14A265387
- Number of 7Xn integer arrays with each element equal to the number of horizontal and antidiagonal neighbors not equal to itself.at n=13A265997
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 379", based on the 5-celled von Neumann neighborhood.at n=24A271537