14593
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 14594
- 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
- 14592
- Möbius Function
- -1
- Radical
- 14593
- 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
- 45
- 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
- 1710
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Half-quartan primes: primes of the form p = (x^4 + y^4)/2.at n=11A002646
- Numbers k such that the continued fraction for sqrt(k) has period 93.at n=8A020432
- Primes that remain prime through 3 iterations of function f(x) = 5x + 8.at n=22A023286
- a(n) = least m such that if r and s in {1/2, 1/4, 1/6, ..., 1/2n} satisfy r < s, then r < k/m < (k+4)/m < s for some integer k.at n=39A024848
- Smallest prime number, not already in sequence, such that the product M of it and all prior numbers in sequence satisfies 2^(M+1) = 1 (mod M).at n=6A058910
- a(n) = (1/3!)*(n^3 + 24*n^2 + 107*n + 90), compare A059604.at n=37A059605
- a(1) = 1, a(n) = largest prime divisor of A057137(n).at n=7A073844
- a(1) = 1; for n>1, a(n) = the largest prime divisor of the number C(n) formed from the concatenation of 1,2,3,... up to n.at n=7A075022
- Final terms of rows of A077321.at n=37A077323
- Diagonal of triangle in A082737.at n=37A082738
- E.g.f exp(x)*cosh(x+x^2/2).at n=9A085387
- Primes of the form 512n+257.at n=6A105131
- prime(k) for those k where floor((2*(prime(k+1)-prime(k))*PrimePi(k) mod (8*k))/k) = m with m = 8.at n=30A109562
- Primes p such that q-p = 28, where q is the next prime after p.at n=12A124595
- The upper twin prime whose lower member has a prime index.at n=34A129782
- Mother primes of order 9.at n=39A136068
- a(n) = largest prime divisor of A138957(n).at n=7A138961
- E.g.f. satisfies: A(x) = exp(x*A(sin(x))).at n=6A141625
- Primes congruent to 16 mod 43.at n=38A142265
- Primes congruent to 23 mod 47.at n=36A142374