13208
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 26880
- Proper Divisor Sum (Aliquot Sum)
- 13672
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6048
- Möbius Function
- 0
- Radical
- 3302
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 3
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
- Number of cyclic permutations of [n] with no i -> i+1 (mod n).at n=9A000757
- Number of partitions of n that do not contain 3 as a part.at n=39A027337
- Number of 2 X 2 matrices with elements from {0,1,2,...,n} and with Nim-Determinant 1. (The Nim-Determinant of the 2 X 2 matrix [a,b; c,d] is defined to be a*d xor b*c, where * denotes Nim-Multiplication.)at n=38A059954
- Number of partitions of n-th composite number not containing the smallest prime factor.at n=25A091094
- Number of partitions of n into 3-smooth parts.at n=46A105420
- Triangle of succession numbers for circular permutations.at n=45A134832
- Number of partitions of n into as many primes as nonprimes.at n=50A155515
- Number of ways to partition an n X 3 grid into 3 connected equal-area regions.at n=12A167243
- Nonnegative values x of solutions (x, y) to the Diophantine equation x^2+(x+217)^2 = y^2.at n=24A198294
- Fibonacci sequence beginning 14, 13.at n=15A206564
- Numbers n such that sigma(n)+d(n) and sigma(n+1)+d(n+1) are perfect squares.at n=4A224441
- Number of (n+1) X (4+1) 0..3 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 4 (constant-stress 1 X 1 tilings).at n=10A235285
- Number of partitions of n such that the number of even parts is a part or the number of odd parts is a part.at n=37A240576
- Number of partitions of n into 7 parts such that every i-th smallest part (counted with multiplicity) is different from i.at n=30A244243
- Numbers k such that k and k+1 both have 16 divisors.at n=32A274359
- a(n) = PrimePi(A246033(n)) (where PrimePi = A000720).at n=39A290652
- Partial sums of A299255.at n=19A299261
- Apply Lenormand's transformation k -> A318921(k) to the Fibonacci numbers.at n=36A318922
- Number of toroidal necklaces of positive integers summing to n.at n=16A323858
- Number of partitions of n such that 5*(smallest part) = (number of parts).at n=58A350897