14951
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
- 14952
- 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
- 14950
- Möbius Function
- -1
- Radical
- 14951
- 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
- 71
- 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
- 1751
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Numbers k such that (12^k - 1)/11 is prime.at n=10A004064
- Numbers whose least quadratic nonresidue (A020649) is 19.at n=5A025027
- Palindromic primes in base 3.at n=22A029971
- Concatenate n-th prime and n-th composite.at n=34A038530
- Primes that are concatenations of k-th prime and k-th composite.at n=4A038531
- Primes p from A031924 such that A052180(primepi(p)) = 19.at n=15A052235
- First term of weak prime quintets: p(m+1)-p(m) < p(m+2)-p(m+1) < p(m+3)-p(m+2) < p(m+4)-p(m+3).at n=36A054823
- Second term of weak prime quintets: p(m)-p(m-1) < p(m+1)-p(m) < p(m+2)-p(m+1) < p(m+3)-p(m+2).at n=35A054824
- Second term of weak prime sextet: p(m)-p(m-1) < p(m+1)-p(m) < p(m+2)-p(m+1) < p(m+3)-p(m+2) < p(m+4)-p(m+3).at n=3A054829
- Primes p whose reciprocal has period (p-1)/10.at n=23A056215
- Primes with 19 as smallest positive primitive root.at n=13A061331
- Numbers k that, when expressed in base 6 and then interpreted in base 7, give a multiple of k.at n=12A062934
- Primes expressible as the sum of (at least two) consecutive primes in at least 3 ways.at n=26A067379
- Primes p such that x^5 = 2 has a solution mod p, but x^(5^2) = 2 has no solution mod p.at n=10A070182
- G.f.: Sum_{n >= 1} x^n/(1-x^n)^5.at n=22A073570
- a(n) = ceiling(((1*n^0 + 1*n^1 + 2*n^2 + 4*n^3)/(1*n^0 + 2*n^1 + 1*n^2))^2).at n=31A085505
- Number of partitions of 2*n into minimal numbers.at n=41A099385
- Odd numbers n for which 19 is the smallest i (>= 1) with Jacobi symbol J(i,n) getting either a value 0 or -1.at n=7A112078
- a(n) = floor((Pi+e)^(n*e)).at n=2A121916
- a(n) = n^3 - n^2 - 2*n + 1.at n=25A123972