13327
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 13328
- Proper Divisor Sum (Aliquot Sum)
- 1
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 13326
- Möbius Function
- -1
- Radical
- 13327
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 68
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1582
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Number of partial permutations of an n-set; number of n X n binary matrices with at most one 1 in each row and column.at n=6A002720
- Numbers k such that the continued fraction for sqrt(k) has period 92.at n=31A020431
- Least number of Sort-then-add persistence n.at n=30A033863
- Least number of Sort-then-add persistence n.at n=30A033908
- a(n) = Sum_{i=0..n} T(i,n-i), array T as in A049735.at n=18A049736
- Number of multigraphs with loops on 4 nodes with n edges.at n=12A050532
- Denominators of continued fraction for alternating factorial.at n=12A056953
- Initial term in sequence of four consecutive primes separated by 3 consecutive differences each <=6 (i.e., when d=2,4 or 6) and forming d-pattern=[4, 6, 2]; short d-string notation of pattern = [462].at n=23A078851
- Fourth row of Pascal-(1,2,1) array A081577.at n=8A081584
- Lower triangular matrix, read by rows: T(i,j) = number of ways i seats can be occupied by any number k (0<=k<=j<=i) of persons.at n=20A086885
- Triangle of certain generalized Bell numbers.at n=33A090210
- Prime(p)-4 for primes p such that prime(p) - 4 is prime.at n=35A094069
- First of 9 consecutive primes in a 3 X 3 spiral wherein the mean of all 8 sums is prime.at n=39A094454
- Primes prime(k) such that (prime(k-1) + prime(k+1) + prime(k+2))/prime(k) = 3.at n=23A094933
- Prime numbers which when written in base 7 have a composite digit-sum.at n=8A096790
- Numbers k such that the k-th triangular number contains only digits {1,2,8}.at n=15A119108
- Triangle of coefficients of n!*(1 - x)^n*L_n(x/(1 - x)), where L_n(x) is the Laguerre polynomial.at n=27A123202
- Number of ordered trees with n edges, with thinning limbs and with root of degree 2. An ordered tree with thinning limbs is such that if a node has k children, all its children have at most k children.at n=13A124329
- Exponent of least power of 2 having exactly n consecutive 4's in its decimal representation.at n=8A131538
- Primes of the form 2*3*5*7*k + 97.at n=33A141899