13204
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 23114
- Proper Divisor Sum (Aliquot Sum)
- 9910
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6600
- Möbius Function
- 0
- Radical
- 6602
- Omega Function (Ω)
- 3
- 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
- 138
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- Coordination sequence for sigma-CrFe, Position Xf.at n=29A009958
- Positive numbers k such that k and 2*k are anagrams in base 6 (written in base 6).at n=7A023064
- Pisot sequence L(8,9).at n=25A048590
- Number of 5-card poker hands with deuces wild of 5-of-a-kind, royal flush, straight flush, 4-of-a-kind, full house, flush, straight, 3-of-a-kind, two pairs, one pair, no pair.at n=5A057695
- a(n) = (p^2 - p + 2)/2 for p = prime(n); number of squares modulo p^2.at n=37A072205
- One third of the sum of the first n primes, when an integer.at n=39A112270
- Triangle T(n,k) read by rows: number of height-2-restricted finite functions.at n=39A187105
- Numbers whose digits are a permutation of (0,...,m) for some m.at n=38A199168
- Number of labeled star-like graphs on n vertices.at n=5A208356
- Number of 2 X 2 matrices with all terms in {0,1,...,n} and (sum of terms) = n + 3.at n=38A210375
- Half the number of 0..n arrays of length 4 with second differences nonzero.at n=11A212783
- Positions of 3's in A234323.at n=19A234804
- Number of length-n 0..4 arrays with no adjacent pair x,x+1 followed at any distance by x+1,x.at n=5A268453
- T(n,k)=Number of length-n 0..k arrays with no adjacent pair x,x+1 followed at any distance by x+1,x.at n=41A268457
- Number of length-6 0..n arrays with no adjacent pair x,x+1 followed at any distance by x+1,x.at n=3A268460
- Expansion of 1/(1 - x/(1 - x^5/(1 - x^14/(1 - x^30/(1 - x^55/(1 - ... - x^(k*(k+1)*(2*k+1)/6)/(1 - ...))))))), a continued fraction.at n=37A295073
- Starting with a(1) = 0, a(2) = 1, a(n) = smallest nonnegative integer that shares all digits with previous terms. No repeated digits are allowed.at n=39A297062
- Number of compositions (ordered partitions) of n into prime power parts (not including 1) that do not divide n.at n=25A300704
- Numbers k such that 421*2^k+1 is prime.at n=14A316712
- a(n) = 1 + Max_{0<=i<=j<=k; i+j+k=n-1} a(i)*a(j)*a(k) for n>0, with a(0) = 1.at n=19A336631