13047
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
- 4
- Divisor Sum
- 17400
- Proper Divisor Sum (Aliquot Sum)
- 4353
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8696
- Möbius Function
- 1
- Radical
- 13047
- 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
- 200
- 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
- Let y=f(x) satisfy F(x,y)=0. a(n) is the number of terms in the expansion of (d/dx)^n y in terms of the partial derivatives of F.at n=11A003262
- Crystal ball sequence for hexagonal close-packing.at n=15A007202
- Number of partitions satisfying cn(1,5) + cn(4,5) <= cn(2,5) + cn(3,5).at n=38A039894
- Indices of primes in sequence defined by A(0) = 29, A(n) = 10*A(n-1) - 41 for n > 0.at n=10A101960
- This sequence and A139143 are complements. a(1) = 1, A139143(1) = 2, a(n+1) = a(n) + Sum_{k = 1..n} A139143(k).at n=39A139142
- Values of m such that A139361(n)=4m+1.at n=29A139362
- Number of subsets of {1,...,n} having mean=median.at n=17A212146
- Number of 3 X 3 0..n symmetric arrays with all rows summing to floor(n*3/2).at n=29A213801