14251
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 14252
- 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
- 14250
- Möbius Function
- -1
- Radical
- 14251
- 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
- 50
- 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
- 1675
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes p such that the multiplicative order of 2 modulo p is (p-1)/5.at n=36A001135
- Quintan primes: p = (x^5 - y^5)/(x - y).at n=9A002649
- Expansion of g.f. 1/((1-3*x)*(1-10*x)).at n=4A016145
- Primes that remain prime through 3 iterations of function f(x) = 5x + 6.at n=35A023285
- a(n) = least m such that if r and s in {1/1, 1/3, 1/5, ..., 1/(2n-1)} satisfy r < s, then r < k/m < (k+4)/m < s for some integer k.at n=39A024847
- a(n) = floor( n^Pi ).at n=20A061294
- Primes p such that x^5 = 2 has a solution mod p, but x^(5^2) = 2 has no solution mod p.at n=9A070182
- a(n) is the smallest number k such that A073813(k) = prime(n).at n=30A073814
- Primes of the form floor(k^Pi).at n=1A074218
- a(n) = 8*n^2 + 88*n + 43.at n=37A086760
- Difference between counts of odd composites in A093151 and A093152 [Count (1 mod 4) - count (3 mod 4)].at n=10A093153
- Prime numbers which when written in base 7 have a composite digit-sum.at n=14A096790
- 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=17A109563
- Primes p = prime(i) of level (1,3), i.e., such that A118534(i) = prime(i-3).at n=23A118467
- a(n) is such that the a(n)-th composite number is (n-th prime)^2.at n=30A120389
- Primes p such that q-p = 30, where q is the next prime after p.at n=15A124596
- Mother primes of order 9.at n=38A136068
- Primes of the form (10^n-3^n)/7.at n=2A138931
- Binomial transform of 0, 1, 1, 7, 7, 31, 31, ..., zero followed by duplicated A083420.at n=9A140420
- Primes congruent to 18 mod 43.at n=38A142267