13219
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
- 13220
- 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
- 13218
- Möbius Function
- -1
- Radical
- 13219
- 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
- 138
- 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
- yes
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1572
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Smallest nonempty set S containing prime divisors of 6k+1 for each k in S.at n=25A020602
- Discriminants of quintic fields with 2 complex conjugates (negated).at n=16A023684
- Primes of the form n^2 - 6.at n=19A028880
- Primes base 10 that remain primes in five bases b, 2<=b<=10, expansions interpreted as decimal numbers.at n=40A052029
- The upper twin prime whose lower member has a prime index.at n=31A129782
- Primes congruent to 17 mod 41.at n=40A142214
- Primes congruent to 18 mod 43.at n=34A142267
- Primes congruent to 12 mod 47.at n=33A142363
- Primes congruent to 38 mod 49.at n=34A142446
- Primes congruent to 22 mod 53.at n=28A142552
- Primes congruent to 19 mod 55.at n=38A142615
- Primes congruent to 3 mod 59.at n=25A142730
- Primes congruent to 43 mod 61.at n=23A142841
- Row 3 of array in A144502.at n=4A144496
- Column 4 of array in A144502.at n=3A144500
- Square array read by antidiagonals upwards: T(n,k) is the number of scenarios for the gift exchange problem in which each gift can be stolen at most once, when there are n gifts in the pool and k gifts (not yet frozen) in peoples' hands.at n=32A144502
- Number of n X 2 binary arrays with all 1s connected, a path of 1s from left column to right column, and no 1 having more than two 1s adjacent.at n=13A163723
- Primes of the form 2*n^2 + 58*n + 27.at n=16A217498
- a(n) is the smallest prime which starts a record-length of "alternating" consecutive prime gaps.at n=6A228850
- Primes p with prime(p)^2 + (2*p)^2 and p^2 + (2*prime(p))^2 both prime.at n=30A236193