13151
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 13152
- 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
- 13150
- Möbius Function
- -1
- Radical
- 13151
- 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
- 76
- 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
- 1564
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Numbers whose least quadratic nonresidue (A020649) is 13.at n=37A025025
- Primes followed by an [8,4,8]=[d,D-d,d] prime difference pattern of A001223.at n=7A052377
- Primes p whose reciprocal has period (p-1)/10.at n=20A056215
- Numbers k such that x^k + x^3 + 1 is irreducible over GF(2).at n=37A057461
- Numbers n such that x^n + x^3 + x^2 + x + 1 is irreducible over GF(2).at n=30A057496
- Primes with 13 as smallest positive primitive root.at n=35A061326
- Table(n,j) of primes p = k*prime(n)#/210-j, where k is the least integer such that p and p+8 are consecutive primes, for n > 4 and j=7 to 1.at n=9A098078
- Numbers n such that (n + prime(n)), (n+1 + prime(n+1)), (n+2 + prime(n+2)) and (n+3 + prime(n+3)) are divisible by 5.at n=5A107582
- Numbers k such that (k,k+8) forms a pair of consecutive primes ending respectively in 1 and 9.at n=34A141026
- Primes congruent to 16 mod 37.at n=41A142125
- Primes congruent to 36 mod 43.at n=41A142285
- Primes congruent to 38 mod 47.at n=37A142389
- Primes congruent to 19 mod 49.at n=35A142430
- Primes congruent to 7 mod 53.at n=28A142537
- Primes congruent to 6 mod 55.at n=40A142605
- Primes congruent to 53 mod 59.at n=26A142780
- Primes congruent to 36 mod 61.at n=25A142834
- Pascal-(1,9,1) array.at n=41A143685
- Pascal-(1,9,1) array.at n=39A143685
- Emirps of the form k^2 + k + 41.at n=24A155953