13367
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 13368
- 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
- 13366
- Möbius Function
- -1
- Radical
- 13367
- 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
- 94
- 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
- 1586
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- a(n) = least primitive factor of 2^(2n+1) - 1.at n=20A002184
- Smallest prime factor of Mersenne numbers 2^p-1, where p is prime.at n=12A016047
- Powers of fifth root of 14 rounded down.at n=18A018153
- Primes that are palindromic in base 9.at n=29A029977
- Primes reached in A037271, or -1 if no such prime exists.at n=6A037272
- Primes reached in A037271, or -1 if no such prime exists.at n=16A037272
- Home primes: for n >= 2, a(n) = the prime that is finally reached when you start with n, concatenate its prime factors (A037276) and repeat until a prime is reached (a(n) = -1 if no prime is ever reached).at n=13A037274
- Home primes: for n >= 2, a(n) = the prime that is finally reached when you start with n, concatenate its prime factors (A037276) and repeat until a prime is reached (a(n) = -1 if no prime is ever reached).at n=26A037274
- Trajectory of 14 under prime factor concatenation procedure.at n=13A037923
- Trajectory of 27 under prime factor concatenation procedure.at n=11A037930
- Base-9 palindromes that start with 2.at n=23A043029
- Primes with multiplicative persistence value 5.at n=29A046505
- Smallest prime dividing 2^n - 1.at n=39A049479
- Least prime in A031932 (lesser of 14-twins) whose distance to the next 14-twin is 6*n.at n=19A052356
- Primes of the form k(k+1)/2+1 (i.e., central polygonal numbers, or one more than triangular numbers).at n=41A055469
- Primes p such that x^41 = 2 has no solution mod p.at n=39A059236
- a(0) = 2; a(n) for n > 0 is the smallest prime greater than a(n-1) that differs from a(n-1) by a square.at n=43A073609
- Primes of the form perfect_power(n)+n.at n=19A075781
- For p = prime(n), a(n) is the smallest prime q such that pq is a base-2 pseudoprime; that is, 2^(pq-1) = 1 mod pq; a(n) is 0 if no such prime exists.at n=21A085012
- Triangle read by rows formed by the prime factors of Mersenne number 2^prime(n) - 1, n >= 1.at n=17A089162