13470
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 32400
- Proper Divisor Sum (Aliquot Sum)
- 18930
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3584
- Möbius Function
- 1
- Radical
- 13470
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 89
- 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
- Number of alkyls C_{n+15} H_{2n+10} (Phenan) with n carbon atoms.at n=7A000649
- Coordination sequence for CaF2(1), Ca position.at n=39A009923
- Denominators of continued fraction convergents to sqrt(896).at n=7A042733
- Numbers k such that the product of the first k composite numbers minus 1 is a prime.at n=25A057017
- Numbers k such that usigma(k) is a square and sets a new record for such squares.at n=20A064443
- Matrix product of unsigned Stirling1-triangle |A008275(n,k)| and Stirling1-triangle A008275(n,k).at n=37A079642
- Number of partitions of n such that if the smallest part is k, then both k and k+1 occur exactly once.at n=53A118267
- Integers n > 1 such that A130280(4n^2) < n, i.e., there is an m < n, m > 1 such that 4n^2(m^2 - 1) + 1 is a square.at n=16A130281
- Numbers n such that sigma(n) and sigma(sigma(n)) are both perfect squares.at n=7A134263
- A008585+A029907.at n=17A172050
- Number of (w,x,y) with all terms in {0,...,n} and even range.at n=29A212975
- Numbers k such that Bernoulli number B_{k} has denominator 14322.at n=16A295588
- T(n, k) = [x^k] Sum_{k=0..n} |Stirling1(n, k)|*FallingFactorial(x, k), triangle read by rows, for n >= 0 and 0 <= k <= n.at n=47A325873
- Expansion of Product_{i>=1, j>=1} (1 + i*x^(i*j)).at n=16A333653
- Number of partitions of n into an odd number of parts that are not multiples of 3.at n=51A339405
- E.g.f.: log(1 - log(1 - x))^2 / 2.at n=7A341575
- Antidiagonal sums of A343052.at n=42A379703