13949
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 15960
- Proper Divisor Sum (Aliquot Sum)
- 2011
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12096
- Möbius Function
- -1
- Radical
- 13949
- Omega Function (Ω)
- 3
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 133
- 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
- no
- Odd
- yes
Appears in sequences
- Reverse of smallest prime factor of k = largest prime factor of k+1; a(1)=1.at n=15A071392
- Expansion of g.f. (1 + x + 2*x^2)/((1 - x)^3*(1 - x^3)).at n=38A092498
- Numbers which are the sum of two positive cubes and divisible by 37.at n=16A102618
- Inverse Euler transform of A118052.at n=62A118054
- Number of quadruples [i,j,k,l] with all entries between 1 and n such that gcd(i,j) = gcd(k,l).at n=12A124162
- a(n) = 62*n^2 - 1.at n=14A158680
- Prime terms multiplied by Fibonacci terms (omitting first two terms of Fibonacci sequence).at n=11A160190
- Numbers of the form ((6k+5)^2+9)/2 or 2(3k+4)^2-9.at n=54A214493
- Numbers which are the sum of two positive cubes and divisible by 29.at n=9A224483
- Number of partitions p of n such that (number of numbers of the form 3k in p) is a part of p.at n=37A241546
- Concatenation of n-th prime and n-th nonprime.at n=33A253910
- Indices of powers of two in A055744 (the sequence of n that have the same prime power set as phi(n)).at n=28A256248
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 534", based on the 5-celled von Neumann neighborhood.at n=36A272788
- Products p*q*r of three distinct primes such that (p*q) mod r, (p*r) mod q and (q*r) mod p are all prime.at n=12A338704
- Products p*q*r of three distinct primes such that s=(p*q) mod r, t=(p*r) mod q and u=(q*r) mod p, and s+t+u are all prime.at n=2A338705
- Number of even-length integer partitions of n with integer median.at n=40A361653
- Number of directed multigraphs without loops containing n edges and an infinite number of vertices modulo isomorphism and reversal of all edge directions.at n=7A363163
- Index where prime(n) appears as a term in A379442.at n=43A379558
- Sphenic numbers k such that floor(log(k)/log(lpf(k))) = 1+floor(log(k)/log(p)) for all primes p | k such that p > lpf(k), where lpf = A020639(k).at n=30A383177