14071
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
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 14072
- 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
- 14070
- Möbius Function
- -1
- Radical
- 14071
- 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
- 107
- 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
- 1659
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Expansion of 1/((1-x)*(1-2x)*(1-3x)*(1-9x)).at n=4A021048
- Primes that remain prime through 3 iterations of function f(x) = 9x + 2.at n=30A023296
- Primes of form 210*p + 1 where p is a prime.at n=12A051648
- Primes p such that x^67 = 2 has no solution mod p.at n=25A059330
- Prime(n) and prime(n+4) use the same digits.at n=15A069796
- Primes of the form 210n + 1.at n=31A073102
- Numbers n such that 6n+5, 6n+11, 6n+17, 6n+23 are consecutive primes or 6n+1, 6n+7, 6n+13, 6n+19 are consecutive primes.at n=30A090833
- Numbers k such that 6*k+5, 6*k+11, 6*k+17, 6*k+23 are consecutive primes.at n=15A090836
- Slowest increasing sequence in which a(n) is a prime closest to the sum of all previous terms.at n=14A109277
- Primes congruent to 8 mod 41.at n=41A142205
- Primes congruent to 10 mod 43.at n=36A142259
- Primes congruent to 18 mod 47.at n=36A142369
- Primes congruent to 8 mod 49.at n=39A142420
- Primes congruent to 26 mod 53.at n=28A142556
- Primes congruent to 46 mod 55.at n=40A142633
- Primes congruent to 29 mod 59.at n=31A142756
- Primes congruent to 41 mod 61.at n=27A142839
- Primes p such that the multiplicative order of 2 modulo p is (p-1)/10.at n=20A152310
- Prime numbers ending in the prime number 71.at n=36A167441
- Number of n-digit Type-2 Trott-like Constants (see A178160 for definition).at n=5A178161