14087
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
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 14088
- 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
- 14086
- Möbius Function
- -1
- Radical
- 14087
- 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
- 58
- 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
- yes
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1662
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Diagonals of Pascal's triangle mod 2 interpreted as binary numbers.at n=26A006921
- Lower prime of a record difference between it and the second prime after it.at n=14A031133
- Lower prime of a difference of 20 between consecutive primes.at n=29A031938
- Least prime in A031938 (lesser of primes differing by 20) whose distance to the next 20-twin is 6*n.at n=11A052359
- Third term of weak prime quintets: p(m-1)-p(m-2) < p(m)-p(m-1) < p(m+1)-p(m) < p(m+2)-p(m+1).at n=32A054825
- Frobenius number of the numerical semigroup generated by three consecutive pentagonal numbers.at n=12A069757
- n for which floor((3/2)^n) is prime.at n=25A070759
- Safe primes (A005385) (p and (p-1)/2 are primes) such that 6*p+1 is also prime.at n=43A075705
- Primes p = p_(n+1) such that p_n + p_(n+2) = 2*p_(n+1) + 16.at n=36A095651
- Numbers k such that the k-th triangular number contains only digits {2,8,9}.at n=3A119181
- Primes p such that (p + nextprime + p) and also (p + previousprime + p) are primes.at n=34A125146
- Prime chain of 128 terms, including 104 distinct primes, consisting of the output of eight equations that alternate sequentially within a procedural expression of a single polynomial. The equations are either subsequences of x^2 - 79x + 1601 or transforms with one exception: 100x^2 - 2260x + 12959. The other four distinct equations are Euler-derived: 25x^2 - 1185x + 14083, 25x^2 - 775x + 6047, 100x^2 - 2280x + 13159, 100x^2 - 4160x + 43427.at n=1A140708
- Primes of the form 210k + 17.at n=33A140842
- Primes congruent to 26 mod 43.at n=36A142275
- Primes congruent to 34 mod 47.at n=38A142385
- Primes congruent to 42 mod 53.at n=30A142572
- Primes congruent to 45 mod 59.at n=28A142772
- Primes congruent to 57 mod 61.at n=28A142855
- Let N(p,i) denote the result of applying "nextprime" i times to p; a(n) = smallest prime p such that N(p,2) - p = 2*n, or -1 if no such prime exists.at n=27A144103
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, 1), (1, -1, 1), (1, 1, -1), (1, 1, 0)}.at n=8A149302