14713
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 14714
- 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
- 14712
- Möbius Function
- -1
- Radical
- 14713
- 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
- 102
- 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
- 1721
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- If d,e are consecutive digits of n in base 7, then |d-e|>=5.at n=42A032995
- Revert transform of (-1 + 3x^2)/(-1 - x + 4x^2 + x^3).at n=14A049132
- Primes p = prime(k) such that prime(k) + prime(k+5) = prime(k+1) + prime(k+4) = prime(k+2) + prime(k+3).at n=40A064101
- Prime(n) and prime(n+3) use the same digits.at n=15A069795
- Number of configurations of the sliding block 8-puzzle that require a minimum of n moves to be reached, starting with the empty square at mid-side.at n=20A089483
- Primes prime(k) such that (prime(k-1) + prime(k+1) + prime(k+2))/prime(k) = 3.at n=28A094933
- Smallest prime equal to the sum of exactly 2n+1 distinct odd primes.at n=39A100694
- Numbers n such that P(4n) is prime, where P(m) is the number of partitions of m.at n=38A111045
- Primes of the form 210n + 13.at n=36A140841
- Primes congruent to 35 mod 41.at n=40A142232
- Primes congruent to 7 mod 43.at n=41A142256
- Primes congruent to 2 mod 47.at n=35A142355
- Primes congruent to 32 mod 53.at n=29A142562
- Primes congruent to 28 mod 55.at n=40A142621
- Primes congruent to 22 mod 59.at n=28A142749
- Primes congruent to 12 mod 61.at n=32A142810
- Primes in toothpick sequence A153006.at n=21A153009
- a(n) = 64*n^3 - 168*n^2 + 148*n - 43.at n=6A160250
- Sequence defined by the recurrence formula a(n+1)=sum(a(p)*a(n-p)+k,p=0..n)+l for n>=1, with here a(0)=1, a(1)=8, k=0 and l=-1.at n=6A177165
- Smallest emirp corresponding to the prime of A178581.at n=15A178582