14519
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
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 14520
- 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
- 14518
- Möbius Function
- -1
- Radical
- 14519
- 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
- 164
- 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
- 1700
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes that remain prime through 4 iterations of function f(x) = 6x + 5.at n=19A023317
- [ 3rd elementary symmetric function of {sqrt(k+1)} ], k = 1,2,...,n.at n=13A025220
- a(n) = prime(100*n).at n=16A031921
- Number of partitions with at most one part divisible by 5.at n=35A039905
- Primes p such that x^61 = 2 has no solution mod p.at n=30A059230
- Primes with 13 as smallest positive primitive root.at n=37A061326
- Primes which are the concatenation of numbers n_1, n_2, n_3, in that order, with n_1 + n_2 = n_3 (leading zeros are forbidden for nonzero n_i).at n=21A067860
- Primes p such that (3*p)^2 + p^2 + 3^2 and (3*p)^2 - p^2 - 3^2 are both prime.at n=39A079796
- Primes in which the digit string can be partitioned into three parts such that the sum of the first two is equal to the third, and the second part is nonzero.at n=20A088291
- a(n) = 2*a(n-2)+4*a(n-4)+a(n-6), n>9.at n=18A107856
- Primes for which the weight as defined in A117078 is 15 and the gap as defined in A001223 is 14.at n=23A118380
- Let r be the matrix {{1,1},{0,1}} and b={{1,0},{1,0}}. Let A be the semigroup generated by r and b. a(n) is the number of words of length n in A.at n=38A121946
- a(n) = Sum_{m=1..n} gcd(s(n,m), S(n,m)), where s(n,m) is an unsigned Stirling number of the first kind and S(n,m) is a Stirling number of the second kind.at n=9A128266
- Right truncatable primes in base 9 (written in decimal form).at n=40A129693
- Prime numbers k such that k^2 +- (k+1) are primes.at n=37A137460
- Primes p such that p^3 +- (p+1) are primes.at n=21A137472
- Primes of the form 210k + 29.at n=37A140845
- Primes congruent to 43 mod 47.at n=40A142394
- Primes congruent to 50 mod 53.at n=31A142580
- Primes congruent to 5 mod 59.at n=32A142732