13502
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 20856
- Proper Divisor Sum (Aliquot Sum)
- 7354
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6552
- Möbius Function
- -1
- Radical
- 13502
- 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
- 138
- 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
- yes
- Odd
- no
Appears in sequences
- Expansion of (1-x^6) / (1-x)^6.at n=15A008488
- a(0) = 1, a(n) = 15*n^2 + 2 for n>0.at n=30A010005
- a(n) = sum of n-th row of the triangle formed by replacing each m in Pascal's triangle with the m-th prime.at n=11A074663
- a(n) = binomial(n+6,5) - binomial(n,5).at n=14A120478
- Expansion of x/((1-x)^2(1+x-x^3-x^4-x^5-x^6-x^7+x^9+x^10)).at n=46A143611
- 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, 0, 0), (-1, 1, 1), (0, -1, 0), (0, 0, 1), (1, 1, -1)}.at n=9A148476
- Numbers k such that 5^k mod 2^k is prime.at n=28A178996
- Number of partitions of n such that the number of parts having multiplicity >1 is not a part and the number of distinct parts is a part.at n=45A241410
- Number of compositions of n with exactly one descent.at n=16A241626
- Number of partitions p of n such that 2*(number of even numbers in p) = (number of odd numbers in p).at n=47A241653
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 94", based on the 5-celled von Neumann neighborhood.at n=35A270135
- Least number x such that x^n has n digits equal to k. Case k = 9.at n=20A285456