13147
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
- 13148
- 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
- 13146
- Möbius Function
- -1
- Radical
- 13147
- 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
- 63
- 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
- 1563
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Modified Engel expansion of 3/7.at n=12A006693
- Primes that divide at least one term of Sylvester's sequence s = A000058: s(n+1) = s(n)^2 - s(n) + 1, s(0) = 2.at n=25A007996
- Upper prime of a difference of 20 between consecutive primes.at n=26A031939
- Primes whose consecutive digits differ by 2 or 3.at n=47A048414
- Primes p such that number of primes produced according to rules stipulated in Honaker's A048853 is 4.at n=35A050666
- Numbers k such that k^2 contains exactly 9 different digits.at n=10A054037
- a(n) = p.q in decimal notation where p = prime(n) and q is the smallest prime (A066065(n)) such that the concatenation p.q is a prime.at n=31A066064
- a(1) = 1; set of digits of a(n)^2 is a subset of the set of digits of a(n+1)^2.at n=23A066825
- Primes p such that p + 2^2, p + 4^2 and p + 6^2 are also primes.at n=22A092475
- Lesser member p of cousin primes (p, p+4) such that (p+1, p+2, p+3) all have the same number of prime divisors (counted with multiplicity).at n=13A094230
- Initial members of quintuplets (p, p+4, p+12, p+16, p+24) of consecutive primes with the corresponding difference pattern is {4,8,4,8}.at n=0A102331
- Tribonacci analog of A055502.at n=15A113823
- a(n) is the number of integers k less than 10^n such that the decimal representation of k lacks the digit 1,2,3, at least one of digits 4,5,6 and at least one of digits 7,8,9.at n=4A126639
- Primes for which the period of the reciprocal equals (p-1)/14.at n=12A135073
- Primes p such that 24*p-1, 24*p+1 and 30*p-1, 30*p+1 are twin primes.at n=3A138695
- Primes p such that p, p+4 and p+12 are consecutive primes.at n=35A139385
- Primes congruent to 12 mod 37.at n=41A142121
- Primes congruent to 27 mod 41.at n=35A142224
- Primes congruent to 32 mod 43.at n=32A142281
- Primes congruent to 34 mod 47.at n=34A142385