13558
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 20340
- Proper Divisor Sum (Aliquot Sum)
- 6782
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6778
- Möbius Function
- 1
- Radical
- 13558
- 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
- 89
- 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
- yes
- Odd
- no
Appears in sequences
- Shifts left 2 places under the "BIK" (reversible, indistinct, unlabeled) transform with a(1) = a(2) = 1.at n=14A032131
- Floor( e * (3/2)^n ).at n=21A081225
- Sequence defined by the recurrence formula a(n+1)=sum(a(p)*a(n-p)+k,p=0..n)+l for n>=1, with here a(0)=1, a(1)=0, k=-2 and l=0.at n=11A177110
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 499", based on the 5-celled von Neumann neighborhood.at n=25A272562
- Numbers k such that F(k)*F(k+1) + F(k+2) is a prime, where F = A000045 (Fibonacci numbers).at n=29A305414
- Total number of divisors d of m (counted with multiplicity), such that the prime signature of d is a partition of four and m runs through the set of least numbers whose prime signature is a partition of n.at n=10A309919
- Total number of divisors d of m (counted with multiplicity), such that the prime signature of d is a partition of ten and m runs through the set of least numbers whose prime signature is a partition of n.at n=4A309925