13415
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 16104
- Proper Divisor Sum (Aliquot Sum)
- 2689
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10728
- Möbius Function
- 1
- Radical
- 13415
- 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
- 151
- 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 partitions of n into parts not of the form 25k, 25k+4 or 25k-4. Also number of partitions with at most 3 parts of size 1 and differences between parts at distance 11 are greater than 1.at n=37A036003
- Least k such that k*10^n-9, k*10^n-7, k*10^n-3 and k*10^n-1 are all prime.at n=8A064432
- Duplicate of A064432.at n=8A064972
- The number of primes of the form i^2+j^4 (A028916) <= 10^n, counted with multiplicity.at n=6A226495
- Smallest m such that A070965(m) = -n.at n=42A227954
- Number of n X 2 0..2 arrays with no element equal to one plus the sum of elements to its left or one plus the sum of the sum of elements above it, modulo 3.at n=42A238806
- a(n) = (1/24)*(n + 3)*(3*n^3 + 5*n^2 - 6*n + 16).at n=16A290061
- Partial sums of A299894.at n=30A299895