13933
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 13934
- 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
- 13932
- Möbius Function
- -1
- Radical
- 13933
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 89
- 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
- 1648
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted the two central terms are both 78.at n=0A031666
- Let (p1,p2), (p3,p4) be pairs of twin primes with p1*p2=p3+p4-1; sequence gives values of p2.at n=18A047977
- Primes p such that x^43 = 2 has no solution mod p.at n=37A059243
- Geometric mean of the digits = 3. In other words, the product of the digits is = 3^k where k is the number of digits.at n=37A061427
- Integer part of log(n!)^(1 + log(1 + log(n))).at n=23A062443
- Let r, s, t be three permutations of the set { 1, 2, 3, ..., n }; a(n) = minimal value of Sum_{i=1..n} r(i)*s(i)*t(i).at n=20A070735
- Primes for which the four closest primes are smaller.at n=31A075030
- Primes p such that (r-p)/log(p) > 3, where r is the next prime after p.at n=37A082888
- Smallest prime(k) such that prime(k)-prime(k-n) is equal to prime(k+1)-prime(k).at n=4A089344
- Primes such that least significant digit swapped with all other digits yields primes.at n=36A090934
- Primes p such that p's set of distinct digits is {1,3,9}.at n=29A108383
- prime(k) for those k where floor((2*(prime(k+1)-prime(k))*PrimePi(k) mod (8*k))/k) = m with m = 9.at n=15A109563
- Largest prime factor of the reverse concatenation of the first n consecutive odd numbers.at n=3A109840
- Primes p=prime(i) of level (1,5), i.e., such that A118534(i) = prime(i-5).at n=0A118464
- Primes p such that q-p = 30, where q is the next prime after p.at n=13A124596
- List of primitive prime divisors of the Somos-4 sequence (A006720) in their order of occurrence.at n=34A129741
- a(n) = number of set partitions of {1, 2, ..., n} whose blocks consist only of elements that differ by two or less (that is, have only the forms {i}, {i,i+1}, {i,i+2}, or {i,i+1,i+2}).at n=14A129847
- Prime numbers p such that p +- ((p-1)/2) are primes.at n=32A137702
- Primes of the form k^2 + 9.at n=17A138353
- Primes of the form 210k + 73.at n=34A140857