14797
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 28
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 14798
- 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
- 14796
- Möbius Function
- -1
- Radical
- 14797
- 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
- 1734
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 58 ones.at n=37A031826
- Lucky numbers with size of gaps equal to 20 (lower terms).at n=30A031902
- Numerators of continued fraction convergents to sqrt(543).at n=5A042038
- Numbers whose base-11 representation has exactly 5 runs.at n=22A043648
- Primes with multiplicative persistence value 5.at n=33A046505
- Primes whose sum of digits is the perfect number 28.at n=35A048517
- First term of strong 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=33A054808
- a(n) = Sum_{k=1..n} lcm(k,n)/gcd(k,n).at n=39A056789
- Binomial transform of A002024.at n=12A065979
- Diagonal of array A085205.at n=11A085228
- Primes that are a sum of twin primes and their indices.at n=40A088187
- G.f.: A(x) = Product_{n>=1} 1/(1 - A007947(n)*x^n)^(1/n), where A007947(n) is the product of the distinct prime factors of n.at n=25A094947
- Primes arising in A073946.at n=13A113943
- Numbers k such that (3^k + 7^k)/10 is prime.at n=6A128067
- Binomial transform of A120070.at n=10A141595
- Primes of the form 2*3*5*7*k + 97.at n=35A141899
- Primes congruent to 5 mod 43.at n=41A142254
- Primes congruent to 39 mod 47.at n=36A142390
- Primes congruent to 10 mod 53.at n=31A142540
- Primes congruent to 47 mod 59.at n=31A142774