13342
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 22896
- Proper Divisor Sum (Aliquot Sum)
- 9554
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5712
- Möbius Function
- -1
- Radical
- 13342
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 182
- 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
- Coefficients of the '6th-order' mock theta function 2 mu(q).at n=49A053273
- a(n) = Sum_{i=1..n} Sum_{j=1..i} (prime(i) - prime(j)).at n=26A062020
- Number of basis partitions of n+81 with Durfee square size 9.at n=23A069252
- Egyptian fraction representation for the cube root of 5.at n=3A132482
- Smallest k such that 3^(3^n) - k is prime.at n=8A140331
- T(n,k)=Number of (n+1)X(k+1) 0..5 arrays with every 2X2 subblock commuting with each of its horizontal and vertical 2X2 subblock neighbors.at n=11A186486
- T(n,k)=Number of (n+1)X(k+1) 0..5 arrays with every 2X2 subblock commuting with each of its horizontal and vertical 2X2 subblock neighbors.at n=13A186486
- T(n,m)=Number of (n+1)X5 0..m arrays with every 2X2 subblock commuting with each of its horizontal and vertical 2X2 subblock neighbors.at n=16A189174
- T(n,m)=Number of (n+1)X3 0..m arrays with every 2X2 subblock commuting with each of its horizontal and vertical 2X2 subblock neighbors.at n=31A190023
- Number of connected graphs with n nodes that are chordal and are open-bowtie free.at n=13A243799
- Number of rooted trees with n nodes and 7-colored non-root nodes.at n=5A246236
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 326", based on the 5-celled von Neumann neighborhood.at n=39A271261
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 565", based on the 5-celled von Neumann neighborhood.at n=22A272945
- Products of distinct numbers in A052963.at n=38A274453
- Numbers k such that 417*2^k+1 is prime.at n=43A323108
- Numerator of the average distance among first n primes.at n=25A332094
- T(j,k) are the numerators s in the representation R = s/t + (2/Pi)*u/v of the resistance between two nodes separated by the distance vector (j,k) in an infinite square lattice of one-ohm resistors, where T(j,k), j >= 0, 0 <= k <= j, is a triangle read by rows.at n=38A355565