13557
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 18080
- Proper Divisor Sum (Aliquot Sum)
- 4523
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9036
- Möbius Function
- 1
- Radical
- 13557
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 37
- 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
- G.f. satisfies A(x) = 1 + x*cycle_index(Alt(4), A(x)).at n=13A036717
- The first k digits of k! form a prime number.at n=5A060323
- a(n) is the smallest number such that the product of its digits is n times the sum of its digits, or 0 if no such number exists.at n=24A126789
- A126789 with zeros removed.at n=18A176623
- a(n) = arrange digits of concatenation of divisors of n (A037278, A176558) in increasing order in base 10 (zero digits are omitted).at n=34A243361
- Number of length 3 1..(n+2) arrays with no leading partial sum equal to a prime.at n=30A254541
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 294", based on the 5-celled von Neumann neighborhood.at n=42A271134
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 497", based on the 5-celled von Neumann neighborhood.at n=25A272558
- Number of partitions of n-th triangular number (A000217) into distinct triangular parts.at n=40A288126
- Numbers n such that A307042(n) = Sum_{k=1..n} esigma(k) is divisible by n, where esigma(k) is sum of exponential divisors of k (A051377).at n=10A307043
- Number of uniform rooted trees with n nodes.at n=13A317712
- Number of ways to split an integer partition of n into consecutive subsequences.at n=13A323583
- Smallest number obtained by concatenating a permutation of the divisors of n.at n=34A390599